TSTP Solution File: SYN560-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN560-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Sat May 4 10:22:24 EDT 2024
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 14 unt; 3 nHn; 33 RR)
% Number of literals : 88 ( 0 equ; 52 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p8_9,negated_conjecture,
( p8(X1,X2)
| ~ p8(X1,X3)
| ~ p8(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',p8_9) ).
cnf(p2_15,negated_conjecture,
( p2(X1,f3(c10))
| p8(f6(X1,X2),f6(X1,f5(X2,f3(f7(c10))))) ),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',p2_15) ).
cnf(not_p2_2,negated_conjecture,
~ p2(c9,f3(c10)),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',not_p2_2) ).
cnf(p2_8,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',p2_8) ).
cnf(p8_12,negated_conjecture,
( p8(X1,X2)
| ~ p2(X3,X2)
| ~ p8(X4,X3)
| ~ p2(X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',p8_12) ).
cnf(p8_10,negated_conjecture,
p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14)))),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',p8_10) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',p2_1) ).
cnf(p2_14,negated_conjecture,
( p2(f6(X1,X2),f6(X3,X4))
| ~ p2(X2,X4)
| ~ p2(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',p2_14) ).
cnf(p2_4,negated_conjecture,
p2(f4(X1),f5(X1,f3(f7(c10)))),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',p2_4) ).
cnf(p2_7,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',p2_7) ).
cnf(not_p8_11,negated_conjecture,
~ p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))),
file('/export/starexec/sandbox/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p',not_p8_11) ).
cnf(c_0_11,negated_conjecture,
( p8(X1,X2)
| ~ p8(X1,X3)
| ~ p8(X3,X2) ),
inference(fof_simplification,[status(thm)],[p8_9]) ).
cnf(c_0_12,negated_conjecture,
( p8(X1,X2)
| ~ p8(X1,X3)
| ~ p8(X3,X2) ),
c_0_11 ).
cnf(c_0_13,negated_conjecture,
( p2(X1,f3(c10))
| p8(f6(X1,X2),f6(X1,f5(X2,f3(f7(c10))))) ),
p2_15 ).
cnf(c_0_14,negated_conjecture,
~ p2(c9,f3(c10)),
inference(fof_simplification,[status(thm)],[not_p2_2]) ).
cnf(c_0_15,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
inference(fof_simplification,[status(thm)],[p2_8]) ).
cnf(c_0_16,negated_conjecture,
( p8(X1,X2)
| ~ p2(X3,X2)
| ~ p8(X4,X3)
| ~ p2(X4,X1) ),
inference(fof_simplification,[status(thm)],[p8_12]) ).
cnf(c_0_17,negated_conjecture,
( p8(X1,f6(X2,f5(X3,f3(f7(c10)))))
| p2(X2,f3(c10))
| ~ p8(X1,f6(X2,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14)))),
p8_10 ).
cnf(c_0_19,negated_conjecture,
~ p2(c9,f3(c10)),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
p2(X1,X1),
p2_1 ).
cnf(c_0_22,negated_conjecture,
( p2(f6(X1,X2),f6(X3,X4))
| ~ p2(X2,X4)
| ~ p2(X1,X3) ),
inference(fof_simplification,[status(thm)],[p2_14]) ).
cnf(c_0_23,negated_conjecture,
( p8(X1,X2)
| ~ p2(X3,X2)
| ~ p8(X4,X3)
| ~ p2(X4,X1) ),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
p8(f6(c9,f4(c12)),f6(c9,f5(f4(f5(c12,c14)),f3(f7(c10))))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( p2(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( p2(f6(X1,X2),f6(X3,X4))
| ~ p2(X2,X4)
| ~ p2(X1,X3) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
( p8(X1,X2)
| ~ p2(f6(c9,f5(f4(f5(c12,c14)),f3(f7(c10)))),X2)
| ~ p2(f6(c9,f4(c12)),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( p2(f6(X1,X2),f6(X3,X4))
| ~ p2(X4,X2)
| ~ p2(X3,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
p2(f4(X1),f5(X1,f3(f7(c10)))),
p2_4 ).
cnf(c_0_30,negated_conjecture,
( p8(X1,f6(X2,X3))
| ~ p2(X3,f5(f4(f5(c12,c14)),f3(f7(c10))))
| ~ p2(f6(c9,f4(c12)),X1)
| ~ p2(X2,c9) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( p2(X1,f5(X2,f3(f7(c10))))
| ~ p2(f4(X2),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
inference(fof_simplification,[status(thm)],[p2_7]) ).
cnf(c_0_33,negated_conjecture,
~ p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))),
inference(fof_simplification,[status(thm)],[not_p8_11]) ).
cnf(c_0_34,negated_conjecture,
( p8(X1,f6(X2,X3))
| ~ p2(f4(f4(f5(c12,c14))),X3)
| ~ p2(f6(c9,f4(c12)),X1)
| ~ p2(X2,c9) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( p2(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
c_0_32 ).
cnf(c_0_36,negated_conjecture,
~ p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))),
c_0_33 ).
cnf(c_0_37,negated_conjecture,
( p8(X1,f6(X2,f4(X3)))
| ~ p2(f6(c9,f4(c12)),X1)
| ~ p2(f4(f5(c12,c14)),X3)
| ~ p2(X2,c9) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21]),c_0_21]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN560-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 10:31:05 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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/tmp/tmp.5j6ZkiuoXw/E---3.1_5613.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5690 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGUNS-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting sh5l with 136s (1) cores
% 0.20/0.50 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5695 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGUNS-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 15
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 15
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 15
% 0.20/0.50 # Processed clauses : 184
% 0.20/0.50 # ...of these trivial : 1
% 0.20/0.50 # ...subsumed : 56
% 0.20/0.50 # ...remaining for further processing : 127
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 4
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 786
% 0.20/0.50 # ...of the previous two non-redundant : 733
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 786
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 68
% 0.20/0.50 # ...of those cached : 49
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 108
% 0.20/0.50 # Positive orientable unit clauses : 16
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 90
% 0.20/0.50 # Current number of unprocessed clauses: 572
% 0.20/0.50 # ...number of literals in the above : 1638
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 19
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 1941
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 1723
% 0.20/0.50 # Non-unit clause-clause subsumptions : 60
% 0.20/0.50 # Unit Clause-clause subsumption calls : 2
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 7
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 12024
% 0.20/0.50 # Search garbage collected termcells : 35
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.014 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.015 s
% 0.20/0.50 # Maximum resident set size: 1652 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.066 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.071 s
% 0.20/0.50 # Maximum resident set size: 1704 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------