TSTP Solution File: SYN572-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN572-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:33:07 EDT 2023
% Result : Unsatisfiable 31.85s 4.58s
% Output : CNFRefutation 31.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 45 ( 26 unt; 0 nHn; 19 RR)
% Number of literals : 76 ( 0 equ; 33 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p2_20,negated_conjecture,
( p2(f3(X1,X2),f3(X3,X4))
| ~ p2(X1,X3)
| ~ p2(X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p2_20) ).
cnf(p2_11,negated_conjecture,
p2(f3(X1,f9(X1)),f5(f7(f8(c13)))),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p2_11) ).
cnf(p2_12,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p2_12) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p2_1) ).
cnf(p2_5,negated_conjecture,
p2(f3(X1,f5(f7(f8(c13)))),X1),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p2_5) ).
cnf(p2_17,negated_conjecture,
p2(f3(X1,f3(X2,X3)),f3(f3(X1,X2),X3)),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p2_17) ).
cnf(p4_19,negated_conjecture,
( p4(f11(X1,X2),f11(X3,X4))
| ~ p4(X1,X3)
| ~ p4(X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p4_19) ).
cnf(p4_4,negated_conjecture,
p4(f10(f9(X1)),f10(X1)),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p4_4) ).
cnf(p12_18,negated_conjecture,
( p12(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X4,X2)
| ~ p12(X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p12_18) ).
cnf(p4_3,negated_conjecture,
p4(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p4_3) ).
cnf(p4_9,negated_conjecture,
( p4(f10(X1),f10(X2))
| ~ p2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p4_9) ).
cnf(p12_15,negated_conjecture,
p12(f10(f3(X1,X2)),f11(f10(X1),f10(X2))),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',p12_15) ).
cnf(not_p12_16,negated_conjecture,
~ p12(f10(c14),f11(f10(f3(c14,c15)),f10(c15))),
file('/export/starexec/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p',not_p12_16) ).
cnf(c_0_13,negated_conjecture,
( p2(f3(X1,X2),f3(X3,X4))
| ~ p2(X1,X3)
| ~ p2(X2,X4) ),
p2_20 ).
cnf(c_0_14,negated_conjecture,
p2(f3(X1,f9(X1)),f5(f7(f8(c13)))),
p2_11 ).
cnf(c_0_15,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
p2_12 ).
cnf(c_0_16,negated_conjecture,
p2(X1,X1),
p2_1 ).
cnf(c_0_17,negated_conjecture,
( p2(f3(X1,f3(X2,f9(X2))),f3(X3,f5(f7(f8(c13)))))
| ~ p2(X1,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
p2(f3(X1,f5(f7(f8(c13)))),X1),
p2_5 ).
cnf(c_0_19,negated_conjecture,
( p2(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
p2(f3(X1,f3(X2,f9(X2))),f3(X1,f5(f7(f8(c13))))),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
p2(f3(X1,f3(X2,X3)),f3(f3(X1,X2),X3)),
p2_17 ).
cnf(c_0_22,negated_conjecture,
( p2(X1,X2)
| ~ p2(f3(X2,f5(f7(f8(c13)))),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
p2(f3(X1,f5(f7(f8(c13)))),f3(X1,f3(X2,f9(X2)))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( p2(X1,f3(f3(X2,X3),X4))
| ~ p2(f3(X2,f3(X3,X4)),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
p2(f3(X1,f3(X2,f9(X2))),X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
p2(X1,f3(f3(X1,X2),f9(X2))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( p4(f11(X1,X2),f11(X3,X4))
| ~ p4(X1,X3)
| ~ p4(X2,X4) ),
p4_19 ).
cnf(c_0_28,negated_conjecture,
p4(f10(f9(X1)),f10(X1)),
p4_4 ).
cnf(c_0_29,negated_conjecture,
( p12(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X4,X2)
| ~ p12(X3,X4) ),
p12_18 ).
cnf(c_0_30,negated_conjecture,
p4(X1,X1),
p4_3 ).
cnf(c_0_31,negated_conjecture,
( p4(f10(X1),f10(X2))
| ~ p2(X1,X2) ),
p4_9 ).
cnf(c_0_32,negated_conjecture,
p2(f3(f3(X1,X2),f9(X2)),X1),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( p4(f11(X1,f10(f9(X2))),f11(X3,f10(X2)))
| ~ p4(X1,X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( p12(X1,X2)
| ~ p12(X3,X2)
| ~ p4(X3,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
p4(f10(f3(f3(X1,X2),f9(X2))),f10(X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
p4(f11(X1,f10(f9(X2))),f11(X1,f10(X2))),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( p12(f10(X1),X2)
| ~ p12(f10(f3(f3(X1,X3),f9(X3))),X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
p12(f10(f3(X1,X2)),f11(f10(X1),f10(X2))),
p12_15 ).
cnf(c_0_39,negated_conjecture,
( p12(X1,f11(X2,f10(X3)))
| ~ p12(X4,f11(X2,f10(f9(X3))))
| ~ p4(X4,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
p12(f10(X1),f11(f10(f3(X1,X2)),f10(f9(X2)))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( p12(X1,f11(f10(f3(X2,X3)),f10(X3)))
| ~ p4(f10(X2),X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
~ p12(f10(c14),f11(f10(f3(c14,c15)),f10(c15))),
not_p12_16 ).
cnf(c_0_43,negated_conjecture,
p12(f10(X1),f11(f10(f3(X1,X2)),f10(X2))),
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN572-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 18:35:15 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.hpbfKGuubg/E---3.1_4178.p
% 31.85/4.58 # Version: 3.1pre001
% 31.85/4.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 31.85/4.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.85/4.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 31.85/4.58 # Starting new_bool_3 with 300s (1) cores
% 31.85/4.58 # Starting new_bool_1 with 300s (1) cores
% 31.85/4.58 # Starting sh5l with 300s (1) cores
% 31.85/4.58 # sh5l with pid 4262 completed with status 0
% 31.85/4.58 # Result found by sh5l
% 31.85/4.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 31.85/4.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.85/4.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 31.85/4.58 # Starting new_bool_3 with 300s (1) cores
% 31.85/4.58 # Starting new_bool_1 with 300s (1) cores
% 31.85/4.58 # Starting sh5l with 300s (1) cores
% 31.85/4.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 31.85/4.58 # Search class: FHUNM-FFSF21-MFFFFFNN
% 31.85/4.58 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 31.85/4.58 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 163s (1) cores
% 31.85/4.58 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 4269 completed with status 0
% 31.85/4.58 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 31.85/4.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 31.85/4.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.85/4.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 31.85/4.58 # Starting new_bool_3 with 300s (1) cores
% 31.85/4.58 # Starting new_bool_1 with 300s (1) cores
% 31.85/4.58 # Starting sh5l with 300s (1) cores
% 31.85/4.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 31.85/4.58 # Search class: FHUNM-FFSF21-MFFFFFNN
% 31.85/4.58 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 31.85/4.58 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 163s (1) cores
% 31.85/4.58 # Preprocessing time : 0.001 s
% 31.85/4.58 # Presaturation interreduction done
% 31.85/4.58
% 31.85/4.58 # Proof found!
% 31.85/4.58 # SZS status Unsatisfiable
% 31.85/4.58 # SZS output start CNFRefutation
% See solution above
% 31.85/4.58 # Parsed axioms : 20
% 31.85/4.58 # Removed by relevancy pruning/SinE : 0
% 31.85/4.58 # Initial clauses : 20
% 31.85/4.58 # Removed in clause preprocessing : 0
% 31.85/4.58 # Initial clauses in saturation : 20
% 31.85/4.58 # Processed clauses : 7666
% 31.85/4.58 # ...of these trivial : 3750
% 31.85/4.58 # ...subsumed : 0
% 31.85/4.58 # ...remaining for further processing : 3916
% 31.85/4.58 # Other redundant clauses eliminated : 0
% 31.85/4.58 # Clauses deleted for lack of memory : 0
% 31.85/4.58 # Backward-subsumed : 0
% 31.85/4.58 # Backward-rewritten : 40
% 31.85/4.58 # Generated clauses : 472263
% 31.85/4.58 # ...of the previous two non-redundant : 454790
% 31.85/4.58 # ...aggressively subsumed : 0
% 31.85/4.58 # Contextual simplify-reflections : 0
% 31.85/4.58 # Paramodulations : 472263
% 31.85/4.58 # Factorizations : 0
% 31.85/4.58 # NegExts : 0
% 31.85/4.58 # Equation resolutions : 0
% 31.85/4.58 # Total rewrite steps : 21206
% 31.85/4.58 # Propositional unsat checks : 0
% 31.85/4.58 # Propositional check models : 0
% 31.85/4.58 # Propositional check unsatisfiable : 0
% 31.85/4.58 # Propositional clauses : 0
% 31.85/4.58 # Propositional clauses after purity: 0
% 31.85/4.58 # Propositional unsat core size : 0
% 31.85/4.58 # Propositional preprocessing time : 0.000
% 31.85/4.58 # Propositional encoding time : 0.000
% 31.85/4.58 # Propositional solver time : 0.000
% 31.85/4.58 # Success case prop preproc time : 0.000
% 31.85/4.58 # Success case prop encoding time : 0.000
% 31.85/4.58 # Success case prop solver time : 0.000
% 31.85/4.58 # Current number of processed clauses : 3856
% 31.85/4.58 # Positive orientable unit clauses : 3386
% 31.85/4.58 # Positive unorientable unit clauses: 0
% 31.85/4.58 # Negative unit clauses : 0
% 31.85/4.58 # Non-unit-clauses : 470
% 31.85/4.58 # Current number of unprocessed clauses: 447129
% 31.85/4.58 # ...number of literals in the above : 456384
% 31.85/4.58 # Current number of archived formulas : 0
% 31.85/4.58 # Current number of archived clauses : 60
% 31.85/4.58 # Clause-clause subsumption calls (NU) : 37490
% 31.85/4.58 # Rec. Clause-clause subsumption calls : 31865
% 31.85/4.58 # Non-unit clause-clause subsumptions : 0
% 31.85/4.58 # Unit Clause-clause subsumption calls : 8709
% 31.85/4.58 # Rewrite failures with RHS unbound : 0
% 31.85/4.58 # BW rewrite match attempts : 265411
% 31.85/4.58 # BW rewrite match successes : 40
% 31.85/4.58 # Condensation attempts : 0
% 31.85/4.58 # Condensation successes : 0
% 31.85/4.58 # Termbank termtop insertions : 7725057
% 31.85/4.58
% 31.85/4.58 # -------------------------------------------------
% 31.85/4.58 # User time : 3.697 s
% 31.85/4.58 # System time : 0.249 s
% 31.85/4.58 # Total time : 3.946 s
% 31.85/4.58 # Maximum resident set size: 1632 pages
% 31.85/4.58
% 31.85/4.58 # -------------------------------------------------
% 31.85/4.58 # User time : 3.699 s
% 31.85/4.58 # System time : 0.250 s
% 31.85/4.58 # Total time : 3.949 s
% 31.85/4.58 # Maximum resident set size: 1692 pages
% 31.85/4.58 % E---3.1 exiting
%------------------------------------------------------------------------------