TSTP Solution File: SYN707-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN707-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:18:12 EDT 2023
% Result : Unsatisfiable 8.67s 1.55s
% Output : CNFRefutation 8.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 44 ( 19 unt; 0 nHn; 40 RR)
% Number of literals : 90 ( 0 equ; 48 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p16_42,negated_conjecture,
( p16(X1,X2)
| ~ p16(X3,X1)
| ~ p16(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p16_42) ).
cnf(p16_32,negated_conjecture,
( p16(f19(X1),f19(X2))
| ~ p10(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p16_32) ).
cnf(p10_37,negated_conjecture,
( p10(X1,X2)
| ~ p10(X3,X1)
| ~ p10(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p10_37) ).
cnf(p10_3,negated_conjecture,
p10(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p10_3) ).
cnf(p10_66,negated_conjecture,
p10(c48,f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44))))),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p10_66) ).
cnf(p39_52,negated_conjecture,
( p39(X1,X2)
| ~ p16(X3,X2)
| ~ p39(X4,X3)
| ~ p16(X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p39_52) ).
cnf(p16_36,negated_conjecture,
( p16(f19(f15(X1)),f28(f19(X1)))
| ~ p38(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p16_36) ).
cnf(p39_54,negated_conjecture,
( p39(f19(X1),f19(X2))
| ~ p38(X2)
| ~ p38(X1)
| ~ p37(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p39_54) ).
cnf(p38_15,negated_conjecture,
( p38(f15(X1))
| ~ p38(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p38_15) ).
cnf(p38_19,negated_conjecture,
( p38(X1)
| ~ p38(X2)
| ~ p10(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p38_19) ).
cnf(f11_is_p38_64,negated_conjecture,
p38(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44))))),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',f11_is_p38_64) ).
cnf(p16_8,negated_conjecture,
p16(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p16_8) ).
cnf(p37_13,negated_conjecture,
p37(f15(c56),c48),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',p37_13) ).
cnf(c56_is_p38_1,negated_conjecture,
p38(c56),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',c56_is_p38_1) ).
cnf(not_p39_69,negated_conjecture,
~ p39(f28(f19(c56)),f19(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))))),
file('/export/starexec/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p',not_p39_69) ).
cnf(c_0_15,negated_conjecture,
( p16(X1,X2)
| ~ p16(X3,X1)
| ~ p16(X3,X2) ),
p16_42 ).
cnf(c_0_16,negated_conjecture,
( p16(f19(X1),f19(X2))
| ~ p10(X1,X2) ),
p16_32 ).
cnf(c_0_17,negated_conjecture,
( p10(X1,X2)
| ~ p10(X3,X1)
| ~ p10(X3,X2) ),
p10_37 ).
cnf(c_0_18,negated_conjecture,
p10(X1,X1),
p10_3 ).
cnf(c_0_19,negated_conjecture,
( p16(X1,f19(X2))
| ~ p16(f19(X3),X1)
| ~ p10(X3,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( p10(X1,X2)
| ~ p10(X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
p10(c48,f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44))))),
p10_66 ).
cnf(c_0_22,negated_conjecture,
( p39(X1,X2)
| ~ p16(X3,X2)
| ~ p39(X4,X3)
| ~ p16(X4,X1) ),
p39_52 ).
cnf(c_0_23,negated_conjecture,
( p16(f19(f15(X1)),f28(f19(X1)))
| ~ p38(X1) ),
p16_36 ).
cnf(c_0_24,negated_conjecture,
( p16(f19(X1),f19(X2))
| ~ p10(X3,X2)
| ~ p10(X3,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
p10(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))),c48),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( p39(f28(f19(X1)),X2)
| ~ p39(f19(f15(X1)),X3)
| ~ p16(X3,X2)
| ~ p38(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( p39(f19(X1),f19(X2))
| ~ p38(X2)
| ~ p38(X1)
| ~ p37(X1,X2) ),
p39_54 ).
cnf(c_0_28,negated_conjecture,
( p38(f15(X1))
| ~ p38(X1) ),
p38_15 ).
cnf(c_0_29,negated_conjecture,
( p38(X1)
| ~ p38(X2)
| ~ p10(X2,X1) ),
p38_19 ).
cnf(c_0_30,negated_conjecture,
p38(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44))))),
f11_is_p38_64 ).
cnf(c_0_31,negated_conjecture,
p16(X1,X1),
p16_8 ).
cnf(c_0_32,negated_conjecture,
( p16(f19(X1),f19(c48))
| ~ p10(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( p10(X1,f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))))
| ~ p10(c48,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
( p39(f28(f19(X1)),X2)
| ~ p37(f15(X1),X3)
| ~ p16(f19(X3),X2)
| ~ p38(X1)
| ~ p38(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
p37(f15(c56),c48),
p37_13 ).
cnf(c_0_36,negated_conjecture,
p38(c56),
c56_is_p38_1 ).
cnf(c_0_37,negated_conjecture,
p38(c48),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_30])]) ).
cnf(c_0_38,negated_conjecture,
( p16(X1,X2)
| ~ p16(X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
p16(f19(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44))))),f19(c48)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21])]) ).
cnf(c_0_40,negated_conjecture,
~ p39(f28(f19(c56)),f19(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))))),
not_p39_69 ).
cnf(c_0_41,negated_conjecture,
( p39(f28(f19(c56)),X1)
| ~ p16(f19(c48),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_42,negated_conjecture,
p16(f19(c48),f19(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN707-1 : TPTP v8.1.2. Released v2.5.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n019.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 2400
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon Oct 2 18:38:06 EDT 2023
% 0.14/0.33 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.kkiCQBZiEC/E---3.1_10040.p
% 8.67/1.55 # Version: 3.1pre001
% 8.67/1.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.67/1.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.67/1.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.67/1.55 # Starting new_bool_3 with 300s (1) cores
% 8.67/1.55 # Starting new_bool_1 with 300s (1) cores
% 8.67/1.55 # Starting sh5l with 300s (1) cores
% 8.67/1.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10168 completed with status 0
% 8.67/1.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 8.67/1.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.67/1.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.67/1.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.67/1.55 # No SInE strategy applied
% 8.67/1.55 # Search class: FHUNM-FFMM21-DFFFFFNN
% 8.67/1.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.67/1.55 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 8.67/1.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 8.67/1.55 # Starting new_bool_3 with 136s (1) cores
% 8.67/1.55 # Starting new_bool_1 with 136s (1) cores
% 8.67/1.55 # Starting sh5l with 136s (1) cores
% 8.67/1.55 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10173 completed with status 0
% 8.67/1.55 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 8.67/1.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.67/1.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.67/1.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.67/1.55 # No SInE strategy applied
% 8.67/1.55 # Search class: FHUNM-FFMM21-DFFFFFNN
% 8.67/1.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.67/1.55 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 8.67/1.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 8.67/1.55 # Preprocessing time : 0.003 s
% 8.67/1.55 # Presaturation interreduction done
% 8.67/1.55
% 8.67/1.55 # Proof found!
% 8.67/1.55 # SZS status Unsatisfiable
% 8.67/1.55 # SZS output start CNFRefutation
% See solution above
% 8.67/1.55 # Parsed axioms : 83
% 8.67/1.55 # Removed by relevancy pruning/SinE : 0
% 8.67/1.55 # Initial clauses : 83
% 8.67/1.55 # Removed in clause preprocessing : 0
% 8.67/1.55 # Initial clauses in saturation : 83
% 8.67/1.55 # Processed clauses : 9379
% 8.67/1.55 # ...of these trivial : 34
% 8.67/1.55 # ...subsumed : 5489
% 8.67/1.55 # ...remaining for further processing : 3856
% 8.67/1.55 # Other redundant clauses eliminated : 0
% 8.67/1.55 # Clauses deleted for lack of memory : 0
% 8.67/1.55 # Backward-subsumed : 32
% 8.67/1.55 # Backward-rewritten : 7
% 8.67/1.55 # Generated clauses : 61960
% 8.67/1.55 # ...of the previous two non-redundant : 60695
% 8.67/1.55 # ...aggressively subsumed : 0
% 8.67/1.55 # Contextual simplify-reflections : 7
% 8.67/1.55 # Paramodulations : 61960
% 8.67/1.55 # Factorizations : 0
% 8.67/1.55 # NegExts : 0
% 8.67/1.55 # Equation resolutions : 0
% 8.67/1.55 # Total rewrite steps : 1928
% 8.67/1.55 # Propositional unsat checks : 0
% 8.67/1.55 # Propositional check models : 0
% 8.67/1.55 # Propositional check unsatisfiable : 0
% 8.67/1.55 # Propositional clauses : 0
% 8.67/1.55 # Propositional clauses after purity: 0
% 8.67/1.55 # Propositional unsat core size : 0
% 8.67/1.55 # Propositional preprocessing time : 0.000
% 8.67/1.55 # Propositional encoding time : 0.000
% 8.67/1.55 # Propositional solver time : 0.000
% 8.67/1.55 # Success case prop preproc time : 0.000
% 8.67/1.55 # Success case prop encoding time : 0.000
% 8.67/1.55 # Success case prop solver time : 0.000
% 8.67/1.55 # Current number of processed clauses : 3734
% 8.67/1.55 # Positive orientable unit clauses : 83
% 8.67/1.55 # Positive unorientable unit clauses: 0
% 8.67/1.55 # Negative unit clauses : 5
% 8.67/1.55 # Non-unit-clauses : 3646
% 8.67/1.55 # Current number of unprocessed clauses: 51372
% 8.67/1.55 # ...number of literals in the above : 158067
% 8.67/1.55 # Current number of archived formulas : 0
% 8.67/1.55 # Current number of archived clauses : 122
% 8.67/1.55 # Clause-clause subsumption calls (NU) : 2339547
% 8.67/1.55 # Rec. Clause-clause subsumption calls : 1615146
% 8.67/1.55 # Non-unit clause-clause subsumptions : 5528
% 8.67/1.55 # Unit Clause-clause subsumption calls : 2590
% 8.67/1.55 # Rewrite failures with RHS unbound : 0
% 8.67/1.55 # BW rewrite match attempts : 553
% 8.67/1.55 # BW rewrite match successes : 4
% 8.67/1.55 # Condensation attempts : 0
% 8.67/1.55 # Condensation successes : 0
% 8.67/1.55 # Termbank termtop insertions : 1556416
% 8.67/1.55
% 8.67/1.55 # -------------------------------------------------
% 8.67/1.55 # User time : 1.027 s
% 8.67/1.55 # System time : 0.030 s
% 8.67/1.55 # Total time : 1.056 s
% 8.67/1.55 # Maximum resident set size: 1808 pages
% 8.67/1.55
% 8.67/1.55 # -------------------------------------------------
% 8.67/1.55 # User time : 5.173 s
% 8.67/1.55 # System time : 0.062 s
% 8.67/1.55 # Total time : 5.234 s
% 8.67/1.55 # Maximum resident set size: 1796 pages
% 8.67/1.55 % E---3.1 exiting
% 8.67/1.55 % E---3.1 exiting
%------------------------------------------------------------------------------