TSTP Solution File: SYN604-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN604-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : Tue May 21 07:47:03 EDT 2024
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 18 unt; 2 nHn; 28 RR)
% Number of literals : 81 ( 0 equ; 41 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p3_21,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_21) ).
cnf(p3_4,negated_conjecture,
p3(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_4) ).
cnf(p3_8,negated_conjecture,
p3(f12(f10(X1)),f10(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_8) ).
cnf(p3_7,negated_conjecture,
p3(f4(f8(X1)),f12(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_7) ).
cnf(p16_25,negated_conjecture,
( p16(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X4,X2)
| ~ p16(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_25) ).
cnf(p16_23,negated_conjecture,
( p16(X1,X2)
| ~ p16(X1,X3)
| ~ p16(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_23) ).
cnf(p16_30,negated_conjecture,
( p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),X1)))
| ~ p16(c19,f4(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_30) ).
cnf(p16_9,negated_conjecture,
p16(f10(f11(c21)),f12(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_9) ).
cnf(p16_29,negated_conjecture,
( p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1)))
| ~ p16(f4(X1),f12(c19)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_29) ).
cnf(not_p16_28,negated_conjecture,
~ p16(f4(f6(f7(c20,c18),X1)),f4(f6(f7(c20,c18),f13(X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p16_28) ).
cnf(p16_10,negated_conjecture,
( p16(X1,X2)
| p16(X2,f12(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_10) ).
cnf(c_0_11,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
inference(fof_simplification,[status(thm)],[p3_21]) ).
cnf(c_0_12,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
c_0_11 ).
cnf(c_0_13,negated_conjecture,
p3(X1,X1),
p3_4 ).
cnf(c_0_14,negated_conjecture,
p3(f12(f10(X1)),f10(X1)),
p3_8 ).
cnf(c_0_15,negated_conjecture,
( p3(X1,X2)
| ~ p3(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
p3(f4(f8(X1)),f12(X1)),
p3_7 ).
cnf(c_0_17,negated_conjecture,
( p16(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X4,X2)
| ~ p16(X3,X4) ),
inference(fof_simplification,[status(thm)],[p16_25]) ).
cnf(c_0_18,negated_conjecture,
( p3(X1,f10(X2))
| ~ p3(f12(f10(X2)),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
p3(f12(X1),f4(f8(X1))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( p16(X1,X2)
| ~ p16(X1,X3)
| ~ p16(X3,X2) ),
inference(fof_simplification,[status(thm)],[p16_23]) ).
cnf(c_0_21,negated_conjecture,
( p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),X1)))
| ~ p16(c19,f4(X1)) ),
inference(fof_simplification,[status(thm)],[p16_30]) ).
cnf(c_0_22,negated_conjecture,
( p16(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X4,X2)
| ~ p16(X3,X4) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
p16(f10(f11(c21)),f12(X1)),
p16_9 ).
cnf(c_0_24,negated_conjecture,
p3(f4(f8(f10(X1))),f10(X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( p16(X1,X2)
| ~ p16(X1,X3)
| ~ p16(X3,X2) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
( p16(f4(f6(f7(c20,c18),f8(f10(f11(c21))))),f4(f6(f7(c20,c18),X1)))
| ~ p16(c19,f4(X1)) ),
c_0_21 ).
cnf(c_0_27,negated_conjecture,
( p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1)))
| ~ p16(f4(X1),f12(c19)) ),
inference(fof_simplification,[status(thm)],[p16_29]) ).
cnf(c_0_28,negated_conjecture,
( p16(X1,X2)
| ~ p3(f10(f11(c21)),X1)
| ~ p3(f12(X3),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
p3(f10(X1),f4(f8(f10(X1)))),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
~ p16(f4(f6(f7(c20,c18),X1)),f4(f6(f7(c20,c18),f13(X1)))),
inference(fof_simplification,[status(thm)],[not_p16_28]) ).
cnf(c_0_31,negated_conjecture,
( p16(X1,f4(f6(f7(c20,c18),X2)))
| ~ p16(X1,f4(f6(f7(c20,c18),f8(f10(f11(c21))))))
| ~ p16(c19,f4(X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1)))
| ~ p16(f4(X1),f12(c19)) ),
c_0_27 ).
cnf(c_0_33,negated_conjecture,
( p16(f4(f8(f10(f11(c21)))),X1)
| ~ p3(f12(X2),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
~ p16(f4(f6(f7(c20,c18),X1)),f4(f6(f7(c20,c18),f13(X1)))),
c_0_30 ).
cnf(c_0_35,negated_conjecture,
( p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1)))
| ~ p16(f4(f8(f10(f11(c21)))),f12(c19))
| ~ p16(c19,f4(X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
p16(f4(f8(f10(f11(c21)))),f12(X1)),
inference(spm,[status(thm)],[c_0_33,c_0_13]) ).
cnf(c_0_37,negated_conjecture,
~ p16(f4(f13(c23)),f12(c19)),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( p16(X1,X2)
| p16(X2,f12(X1)) ),
p16_10 ).
cnf(c_0_39,negated_conjecture,
( p16(f4(f6(f7(c20,c18),c23)),f4(f6(f7(c20,c18),X1)))
| ~ p16(c19,f4(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
p16(c19,f4(f13(c23))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN604-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n027.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 15:24:52 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 855 completed with status 0
% 0.22/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FGUNM-FFMF21-MFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.52 # Starting sh5l with 136s (1) cores
% 0.22/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 860 completed with status 0
% 0.22/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FGUNM-FFMF21-MFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 30
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 30
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 30
% 0.22/0.52 # Processed clauses : 237
% 0.22/0.52 # ...of these trivial : 2
% 0.22/0.52 # ...subsumed : 34
% 0.22/0.52 # ...remaining for further processing : 201
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 7
% 0.22/0.52 # Backward-rewritten : 2
% 0.22/0.52 # Generated clauses : 612
% 0.22/0.52 # ...of the previous two non-redundant : 565
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 612
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 54
% 0.22/0.52 # ...of those cached : 28
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 162
% 0.22/0.52 # Positive orientable unit clauses : 22
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 5
% 0.22/0.52 # Non-unit-clauses : 135
% 0.22/0.52 # Current number of unprocessed clauses: 380
% 0.22/0.52 # ...number of literals in the above : 1059
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 39
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 2528
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 2324
% 0.22/0.52 # Non-unit clause-clause subsumptions : 41
% 0.22/0.52 # Unit Clause-clause subsumption calls : 25
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 2
% 0.22/0.52 # BW rewrite match successes : 2
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 9573
% 0.22/0.52 # Search garbage collected termcells : 79
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.020 s
% 0.22/0.52 # System time : 0.002 s
% 0.22/0.52 # Total time : 0.022 s
% 0.22/0.52 # Maximum resident set size: 1660 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.092 s
% 0.22/0.52 # System time : 0.010 s
% 0.22/0.52 # Total time : 0.101 s
% 0.22/0.52 # Maximum resident set size: 1720 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------