TSTP Solution File: SYN642-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN642-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:01 EDT 2023
% Result : Unsatisfiable 1.03s 0.62s
% Output : CNFRefutation 1.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 13 unt; 0 nHn; 21 RR)
% Number of literals : 45 ( 0 equ; 24 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p6_23,negated_conjecture,
( p6(X1,X2)
| ~ p6(X3,X1)
| ~ p6(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.E1kbVJDtnQ/E---3.1_8703.p',p6_23) ).
cnf(p6_4,negated_conjecture,
p6(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.E1kbVJDtnQ/E---3.1_8703.p',p6_4) ).
cnf(p6_33,negated_conjecture,
( p6(f9(X1,X2),f9(X3,X4))
| ~ p6(X2,X4)
| ~ p6(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.E1kbVJDtnQ/E---3.1_8703.p',p6_33) ).
cnf(p6_36,negated_conjecture,
( p6(f8(f10(X1,X2)),f9(f8(X1),f8(X2)))
| ~ p15(X1)
| ~ p15(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.E1kbVJDtnQ/E---3.1_8703.p',p6_36) ).
cnf(not_p6_28,negated_conjecture,
~ p6(f8(f10(f3(c19),f3(c18))),f9(f8(c19),f8(c18))),
file('/export/starexec/sandbox2/tmp/tmp.E1kbVJDtnQ/E---3.1_8703.p',not_p6_28) ).
cnf(p6_14,negated_conjecture,
p6(f8(f3(c18)),f8(c18)),
file('/export/starexec/sandbox2/tmp/tmp.E1kbVJDtnQ/E---3.1_8703.p',p6_14) ).
cnf(p6_9,negated_conjecture,
p6(f8(f3(c19)),f8(c19)),
file('/export/starexec/sandbox2/tmp/tmp.E1kbVJDtnQ/E---3.1_8703.p',p6_9) ).
cnf(f3_is_p15_2,negated_conjecture,
p15(f3(c18)),
file('/export/starexec/sandbox2/tmp/tmp.E1kbVJDtnQ/E---3.1_8703.p',f3_is_p15_2) ).
cnf(f3_is_p15_1,negated_conjecture,
p15(f3(c19)),
file('/export/starexec/sandbox2/tmp/tmp.E1kbVJDtnQ/E---3.1_8703.p',f3_is_p15_1) ).
cnf(c_0_9,negated_conjecture,
( p6(X1,X2)
| ~ p6(X3,X1)
| ~ p6(X3,X2) ),
p6_23 ).
cnf(c_0_10,negated_conjecture,
p6(X1,X1),
p6_4 ).
cnf(c_0_11,negated_conjecture,
( p6(f9(X1,X2),f9(X3,X4))
| ~ p6(X2,X4)
| ~ p6(X1,X3) ),
p6_33 ).
cnf(c_0_12,negated_conjecture,
( p6(X1,X2)
| ~ p6(X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( p6(f8(f10(X1,X2)),f9(f8(X1),f8(X2)))
| ~ p15(X1)
| ~ p15(X2) ),
p6_36 ).
cnf(c_0_14,negated_conjecture,
( p6(X1,f9(X2,X3))
| ~ p6(f9(X4,X5),X1)
| ~ p6(X5,X3)
| ~ p6(X4,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( p6(f9(f8(X1),f8(X2)),f8(f10(X1,X2)))
| ~ p15(X2)
| ~ p15(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ p6(f8(f10(f3(c19),f3(c18))),f9(f8(c19),f8(c18))),
not_p6_28 ).
cnf(c_0_17,negated_conjecture,
( p6(f8(f10(X1,X2)),f9(X3,X4))
| ~ p6(f8(X2),X4)
| ~ p6(f8(X1),X3)
| ~ p15(X2)
| ~ p15(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
p6(f8(f3(c18)),f8(c18)),
p6_14 ).
cnf(c_0_19,negated_conjecture,
p6(f8(f3(c19)),f8(c19)),
p6_9 ).
cnf(c_0_20,negated_conjecture,
p15(f3(c18)),
f3_is_p15_2 ).
cnf(c_0_21,negated_conjecture,
p15(f3(c19)),
f3_is_p15_1 ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN642-1 : TPTP v8.1.2. Released v2.5.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 18:41:14 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.E1kbVJDtnQ/E---3.1_8703.p
% 1.03/0.62 # Version: 3.1pre001
% 1.03/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.03/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.03/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.03/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.03/0.62 # Starting sh5l with 300s (1) cores
% 1.03/0.62 # new_bool_1 with pid 8783 completed with status 0
% 1.03/0.62 # Result found by new_bool_1
% 1.03/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.03/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.03/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.03/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.03/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.62 # Search class: FGUNM-FFMM21-MFFFFFNN
% 1.03/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.62 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.03/0.62 # SAT001_MinMin_p005000_rr_RG with pid 8788 completed with status 0
% 1.03/0.62 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.03/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.03/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.03/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.03/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.03/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.62 # Search class: FGUNM-FFMM21-MFFFFFNN
% 1.03/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.03/0.62 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.03/0.62 # Preprocessing time : 0.001 s
% 1.03/0.62 # Presaturation interreduction done
% 1.03/0.62
% 1.03/0.62 # Proof found!
% 1.03/0.62 # SZS status Unsatisfiable
% 1.03/0.62 # SZS output start CNFRefutation
% See solution above
% 1.03/0.62 # Parsed axioms : 42
% 1.03/0.62 # Removed by relevancy pruning/SinE : 0
% 1.03/0.62 # Initial clauses : 42
% 1.03/0.62 # Removed in clause preprocessing : 0
% 1.03/0.62 # Initial clauses in saturation : 42
% 1.03/0.62 # Processed clauses : 2470
% 1.03/0.62 # ...of these trivial : 0
% 1.03/0.62 # ...subsumed : 1536
% 1.03/0.62 # ...remaining for further processing : 934
% 1.03/0.62 # Other redundant clauses eliminated : 0
% 1.03/0.62 # Clauses deleted for lack of memory : 0
% 1.03/0.62 # Backward-subsumed : 54
% 1.03/0.62 # Backward-rewritten : 0
% 1.03/0.62 # Generated clauses : 10109
% 1.03/0.62 # ...of the previous two non-redundant : 8858
% 1.03/0.62 # ...aggressively subsumed : 0
% 1.03/0.62 # Contextual simplify-reflections : 0
% 1.03/0.62 # Paramodulations : 10109
% 1.03/0.62 # Factorizations : 0
% 1.03/0.62 # NegExts : 0
% 1.03/0.62 # Equation resolutions : 0
% 1.03/0.62 # Total rewrite steps : 2118
% 1.03/0.62 # Propositional unsat checks : 0
% 1.03/0.62 # Propositional check models : 0
% 1.03/0.62 # Propositional check unsatisfiable : 0
% 1.03/0.62 # Propositional clauses : 0
% 1.03/0.62 # Propositional clauses after purity: 0
% 1.03/0.62 # Propositional unsat core size : 0
% 1.03/0.62 # Propositional preprocessing time : 0.000
% 1.03/0.62 # Propositional encoding time : 0.000
% 1.03/0.62 # Propositional solver time : 0.000
% 1.03/0.62 # Success case prop preproc time : 0.000
% 1.03/0.62 # Success case prop encoding time : 0.000
% 1.03/0.62 # Success case prop solver time : 0.000
% 1.03/0.62 # Current number of processed clauses : 838
% 1.03/0.62 # Positive orientable unit clauses : 20
% 1.03/0.62 # Positive unorientable unit clauses: 0
% 1.03/0.62 # Negative unit clauses : 1
% 1.03/0.62 # Non-unit-clauses : 817
% 1.03/0.62 # Current number of unprocessed clauses: 6390
% 1.03/0.62 # ...number of literals in the above : 22556
% 1.03/0.62 # Current number of archived formulas : 0
% 1.03/0.62 # Current number of archived clauses : 96
% 1.03/0.62 # Clause-clause subsumption calls (NU) : 85632
% 1.03/0.62 # Rec. Clause-clause subsumption calls : 79348
% 1.03/0.62 # Non-unit clause-clause subsumptions : 1590
% 1.03/0.62 # Unit Clause-clause subsumption calls : 0
% 1.03/0.62 # Rewrite failures with RHS unbound : 0
% 1.03/0.62 # BW rewrite match attempts : 3
% 1.03/0.62 # BW rewrite match successes : 0
% 1.03/0.62 # Condensation attempts : 0
% 1.03/0.62 # Condensation successes : 0
% 1.03/0.62 # Termbank termtop insertions : 139608
% 1.03/0.62
% 1.03/0.62 # -------------------------------------------------
% 1.03/0.62 # User time : 0.171 s
% 1.03/0.62 # System time : 0.006 s
% 1.03/0.62 # Total time : 0.178 s
% 1.03/0.62 # Maximum resident set size: 1796 pages
% 1.03/0.62
% 1.03/0.62 # -------------------------------------------------
% 1.03/0.62 # User time : 0.173 s
% 1.03/0.62 # System time : 0.008 s
% 1.03/0.62 # Total time : 0.181 s
% 1.03/0.62 # Maximum resident set size: 1716 pages
% 1.03/0.62 % E---3.1 exiting
% 1.03/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------