TSTP Solution File: ITP367_1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ITP367_1 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:21:06 EDT 2024
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 27
% Syntax : Number of formulae : 44 ( 17 unt; 20 typ; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 33 ( 16 ~; 11 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 8 ( 7 usr)
% Number of type conns : 10 ( 5 >; 5 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'A_ltln_set_a_ltln_set_a_ltln_set_fun_fun$': $tType ).
tff(decl_sort2,type,
'A_ltln$': $tType ).
tff(decl_sort3,type,
'A_ltln_set_bool_fun$': $tType ).
tff(decl_sort4,type,
'A_ltln_a_ltln_set_fun$': $tType ).
tff(decl_sort5,type,
'A_ltln_set$': $tType ).
tff(decl_sort6,type,
'A_ltln_set_a_ltln_set_bool_fun_fun$': $tType ).
tff(decl_sort7,type,
'A_ltln_set_a_ltln_set_fun$': $tType ).
tff(decl_23,type,
'subformulas_nu$': 'A_ltln_a_ltln_set_fun$' ).
tff(decl_35,type,
'x$': 'A_ltln_set$' ).
tff(decl_37,type,
'fun_app$a': ( 'A_ltln_set_bool_fun$' * 'A_ltln_set$' ) > $o ).
tff(decl_39,type,
'fun_app$g': ( 'A_ltln_set_a_ltln_set_bool_fun_fun$' * 'A_ltln_set$' ) > 'A_ltln_set_bool_fun$' ).
tff(decl_49,type,
'y$': 'A_ltln_set$' ).
tff(decl_50,type,
'fun_app$h': ( 'A_ltln_a_ltln_set_fun$' * 'A_ltln$' ) > 'A_ltln_set$' ).
tff(decl_51,type,
'subformulas_mu$': 'A_ltln_a_ltln_set_fun$' ).
tff(decl_84,type,
'sup$': 'A_ltln_set_a_ltln_set_a_ltln_set_fun_fun$' ).
tff(decl_85,type,
'less_eq$': 'A_ltln_set_a_ltln_set_bool_fun_fun$' ).
tff(decl_88,type,
'finite$': 'A_ltln_set_bool_fun$' ).
tff(decl_92,type,
'fun_app$d': ( 'A_ltln_set_a_ltln_set_a_ltln_set_fun_fun$' * 'A_ltln_set$' ) > 'A_ltln_set_a_ltln_set_fun$' ).
tff(decl_95,type,
'phi$': 'A_ltln$' ).
tff(decl_96,type,
'fun_app$c': ( 'A_ltln_set_a_ltln_set_fun$' * 'A_ltln_set$' ) > 'A_ltln_set$' ).
tff(conjecture2,conjecture,
'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$','x$'),'y$')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture2) ).
tff(axiom4,axiom,
! [X1: 'A_ltln_set$',X7: 'A_ltln_set$'] :
( 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X1),X7))
<=> ( 'fun_app$a'('finite$',X1)
& 'fun_app$a'('finite$',X7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom4) ).
tff(axiom262,axiom,
! [X1: 'A_ltln_set$',X452: 'A_ltln_set$'] :
( ( 'fun_app$a'('finite$',X1)
& 'fun_app$a'('fun_app$g'('less_eq$',X452),X1) )
=> 'fun_app$a'('finite$',X452) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom262) ).
tff(axiom287,axiom,
! [X486: 'A_ltln$'] : 'fun_app$a'('finite$','fun_app$h'('subformulas_mu$',X486)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom287) ).
tff(axiom70,axiom,
'fun_app$a'('fun_app$g'('less_eq$','x$'),'fun_app$h'('subformulas_mu$','phi$')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom70) ).
tff(axiom288,axiom,
! [X487: 'A_ltln$'] : 'fun_app$a'('finite$','fun_app$h'('subformulas_nu$',X487)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom288) ).
tff(axiom69,axiom,
'fun_app$a'('fun_app$g'('less_eq$','y$'),'fun_app$h'('subformulas_nu$','phi$')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom69) ).
tff(c_0_7,negated_conjecture,
~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$','x$'),'y$')),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conjecture2])]) ).
tff(c_0_8,negated_conjecture,
~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$','x$'),'y$')),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
tff(c_0_9,plain,
! [X1271: 'A_ltln_set$',X1272: 'A_ltln_set$'] :
( ( 'fun_app$a'('finite$',X1271)
| ~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X1271),X1272)) )
& ( 'fun_app$a'('finite$',X1272)
| ~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X1271),X1272)) )
& ( ~ 'fun_app$a'('finite$',X1271)
| ~ 'fun_app$a'('finite$',X1272)
| 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X1271),X1272)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom4])])])]) ).
tff(c_0_10,plain,
! [X1283: 'A_ltln_set$',X1284: 'A_ltln_set$'] :
( ~ 'fun_app$a'('finite$',X1283)
| ~ 'fun_app$a'('fun_app$g'('less_eq$',X1284),X1283)
| 'fun_app$a'('finite$',X1284) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom262])])]) ).
tff(c_0_11,plain,
! [X1425: 'A_ltln$'] : 'fun_app$a'('finite$','fun_app$h'('subformulas_mu$',X1425)),
inference(variable_rename,[status(thm)],[axiom287]) ).
tcf(c_0_12,negated_conjecture,
~ 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$','x$'),'y$')),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
! [X1: 'A_ltln_set$',X4: 'A_ltln_set$'] :
( 'fun_app$a'('finite$','fun_app$c'('fun_app$d'('sup$',X1),X4))
| ~ 'fun_app$a'('finite$',X1)
| ~ 'fun_app$a'('finite$',X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_14,plain,
! [X4: 'A_ltln_set$',X1: 'A_ltln_set$'] :
( 'fun_app$a'('finite$',X4)
| ~ 'fun_app$a'('finite$',X1)
| ~ 'fun_app$a'('fun_app$g'('less_eq$',X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_15,plain,
'fun_app$a'('fun_app$g'('less_eq$','x$'),'fun_app$h'('subformulas_mu$','phi$')),
inference(split_conjunct,[status(thm)],[axiom70]) ).
tcf(c_0_16,plain,
! [X2: 'A_ltln$'] : 'fun_app$a'('finite$','fun_app$h'('subformulas_mu$',X2)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tff(c_0_17,plain,
! [X1352: 'A_ltln$'] : 'fun_app$a'('finite$','fun_app$h'('subformulas_nu$',X1352)),
inference(variable_rename,[status(thm)],[axiom288]) ).
tcf(c_0_18,negated_conjecture,
( ~ 'fun_app$a'('finite$','y$')
| ~ 'fun_app$a'('finite$','x$') ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_19,plain,
'fun_app$a'('finite$','x$'),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
tcf(c_0_20,plain,
'fun_app$a'('fun_app$g'('less_eq$','y$'),'fun_app$h'('subformulas_nu$','phi$')),
inference(split_conjunct,[status(thm)],[axiom69]) ).
tcf(c_0_21,plain,
! [X2: 'A_ltln$'] : 'fun_app$a'('finite$','fun_app$h'('subformulas_nu$',X2)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_22,negated_conjecture,
~ 'fun_app$a'('finite$','y$'),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_21])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ITP367_1 : TPTP v8.2.0. Released v8.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 16:15:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.58 # Version: 3.1.0
% 0.19/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.58 # Starting sh5l with 300s (1) cores
% 0.19/0.58 # new_bool_3 with pid 27684 completed with status 0
% 0.19/0.58 # Result found by new_bool_3
% 0.19/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.58 # Search class: FGHSM-FSLS31-DFFFFFNN
% 0.19/0.58 # partial match(1): FGHSM-FSLM31-DFFFFFNN
% 0.19/0.58 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.58 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.58 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 27687 completed with status 0
% 0.19/0.58 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.58 # Search class: FGHSM-FSLS31-DFFFFFNN
% 0.19/0.58 # partial match(1): FGHSM-FSLM31-DFFFFFNN
% 0.19/0.58 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.58 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.58 # Preprocessing time : 0.008 s
% 0.19/0.58 # Presaturation interreduction done
% 0.19/0.58
% 0.19/0.58 # Proof found!
% 0.19/0.58 # SZS status Theorem
% 0.19/0.58 # SZS output start CNFRefutation
% See solution above
% 0.19/0.58 # Parsed axioms : 734
% 0.19/0.58 # Removed by relevancy pruning/SinE : 438
% 0.19/0.58 # Initial clauses : 508
% 0.19/0.58 # Removed in clause preprocessing : 35
% 0.19/0.58 # Initial clauses in saturation : 473
% 0.19/0.58 # Processed clauses : 534
% 0.19/0.58 # ...of these trivial : 50
% 0.19/0.58 # ...subsumed : 160
% 0.19/0.58 # ...remaining for further processing : 324
% 0.19/0.58 # Other redundant clauses eliminated : 63
% 0.19/0.58 # Clauses deleted for lack of memory : 0
% 0.19/0.58 # Backward-subsumed : 0
% 0.19/0.58 # Backward-rewritten : 3
% 0.19/0.58 # Generated clauses : 96
% 0.19/0.58 # ...of the previous two non-redundant : 32
% 0.19/0.58 # ...aggressively subsumed : 0
% 0.19/0.58 # Contextual simplify-reflections : 0
% 0.19/0.58 # Paramodulations : 47
% 0.19/0.58 # Factorizations : 0
% 0.19/0.58 # NegExts : 0
% 0.19/0.58 # Equation resolutions : 63
% 0.19/0.58 # Disequality decompositions : 0
% 0.19/0.58 # Total rewrite steps : 120
% 0.19/0.58 # ...of those cached : 70
% 0.19/0.58 # Propositional unsat checks : 0
% 0.19/0.58 # Propositional check models : 0
% 0.19/0.58 # Propositional check unsatisfiable : 0
% 0.19/0.58 # Propositional clauses : 0
% 0.19/0.58 # Propositional clauses after purity: 0
% 0.19/0.58 # Propositional unsat core size : 0
% 0.19/0.58 # Propositional preprocessing time : 0.000
% 0.19/0.58 # Propositional encoding time : 0.000
% 0.19/0.58 # Propositional solver time : 0.000
% 0.19/0.58 # Success case prop preproc time : 0.000
% 0.19/0.58 # Success case prop encoding time : 0.000
% 0.19/0.58 # Success case prop solver time : 0.000
% 0.19/0.58 # Current number of processed clauses : 42
% 0.19/0.58 # Positive orientable unit clauses : 17
% 0.19/0.58 # Positive unorientable unit clauses: 0
% 0.19/0.58 # Negative unit clauses : 4
% 0.19/0.58 # Non-unit-clauses : 21
% 0.19/0.58 # Current number of unprocessed clauses: 201
% 0.19/0.58 # ...number of literals in the above : 535
% 0.19/0.58 # Current number of archived formulas : 0
% 0.19/0.58 # Current number of archived clauses : 233
% 0.19/0.58 # Clause-clause subsumption calls (NU) : 6125
% 0.19/0.58 # Rec. Clause-clause subsumption calls : 3421
% 0.19/0.58 # Non-unit clause-clause subsumptions : 142
% 0.19/0.58 # Unit Clause-clause subsumption calls : 13
% 0.19/0.58 # Rewrite failures with RHS unbound : 0
% 0.19/0.58 # BW rewrite match attempts : 108
% 0.19/0.58 # BW rewrite match successes : 32
% 0.19/0.58 # Condensation attempts : 0
% 0.19/0.58 # Condensation successes : 0
% 0.19/0.58 # Termbank termtop insertions : 48722
% 0.19/0.58 # Search garbage collected termcells : 10503
% 0.19/0.58
% 0.19/0.58 # -------------------------------------------------
% 0.19/0.58 # User time : 0.051 s
% 0.19/0.58 # System time : 0.011 s
% 0.19/0.58 # Total time : 0.062 s
% 0.19/0.58 # Maximum resident set size: 4352 pages
% 0.19/0.58
% 0.19/0.58 # -------------------------------------------------
% 0.19/0.58 # User time : 0.083 s
% 0.19/0.58 # System time : 0.015 s
% 0.19/0.58 # Total time : 0.098 s
% 0.19/0.58 # Maximum resident set size: 3188 pages
% 0.19/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------