TSTP Solution File: SYN609-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN609-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:32 EDT 2024
% Result : Unsatisfiable 11.06s 1.84s
% Output : CNFRefutation 11.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 14 unt; 0 nHn; 26 RR)
% Number of literals : 62 ( 0 equ; 36 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p17_20,negated_conjecture,
( p17(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p17(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.iAPd6A0c2l/E---3.1_10656.p',p17_20) ).
cnf(p17_29,negated_conjecture,
p17(f9(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20))))))),f6(f7(f8(c20)))),
file('/export/starexec/sandbox/tmp/tmp.iAPd6A0c2l/E---3.1_10656.p',p17_29) ).
cnf(p2_12,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p3(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.iAPd6A0c2l/E---3.1_10656.p',p2_12) ).
cnf(p3_19,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.iAPd6A0c2l/E---3.1_10656.p',p3_19) ).
cnf(p3_24,negated_conjecture,
( p3(f10(X1,X2),f10(X3,X4))
| ~ p3(X1,X3)
| ~ p3(X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.iAPd6A0c2l/E---3.1_10656.p',p3_24) ).
cnf(p3_4,negated_conjecture,
p3(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.iAPd6A0c2l/E---3.1_10656.p',p3_4) ).
cnf(not_p17_28,negated_conjecture,
~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
file('/export/starexec/sandbox/tmp/tmp.iAPd6A0c2l/E---3.1_10656.p',not_p17_28) ).
cnf(p3_27,negated_conjecture,
p3(f12(f15(f4(f6(f7(f8(c20))))),c21),f15(f4(f6(f7(f8(c20)))))),
file('/export/starexec/sandbox/tmp/tmp.iAPd6A0c2l/E---3.1_10656.p',p3_27) ).
cnf(p2_2,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.iAPd6A0c2l/E---3.1_10656.p',p2_2) ).
cnf(c_0_9,negated_conjecture,
( p17(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p17(X3,X4) ),
inference(fof_simplification,[status(thm)],[p17_20]) ).
cnf(c_0_10,negated_conjecture,
( p17(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p17(X3,X4) ),
c_0_9 ).
cnf(c_0_11,negated_conjecture,
p17(f9(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20))))))),f6(f7(f8(c20)))),
p17_29 ).
cnf(c_0_12,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p3(X1,X2) ),
inference(fof_simplification,[status(thm)],[p2_12]) ).
cnf(c_0_13,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
inference(fof_simplification,[status(thm)],[p3_19]) ).
cnf(c_0_14,negated_conjecture,
( p17(X1,X2)
| ~ p2(f9(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20))))))),X1)
| ~ p2(f6(f7(f8(c20))),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p3(X1,X2) ),
c_0_12 ).
cnf(c_0_16,negated_conjecture,
( p3(f10(X1,X2),f10(X3,X4))
| ~ p3(X1,X3)
| ~ p3(X2,X4) ),
inference(fof_simplification,[status(thm)],[p3_24]) ).
cnf(c_0_17,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
p3(X1,X1),
p3_4 ).
cnf(c_0_19,negated_conjecture,
~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
inference(fof_simplification,[status(thm)],[not_p17_28]) ).
cnf(c_0_20,negated_conjecture,
( p17(f9(X1),X2)
| ~ p3(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20)))))),X1)
| ~ p2(f6(f7(f8(c20))),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( p3(f10(X1,X2),f10(X3,X4))
| ~ p3(X1,X3)
| ~ p3(X2,X4) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( p3(X1,X2)
| ~ p3(X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
p3(f12(f15(f4(f6(f7(f8(c20))))),c21),f15(f4(f6(f7(f8(c20)))))),
p3_27 ).
cnf(c_0_24,negated_conjecture,
~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
( p17(f9(f10(X1,X2)),X3)
| ~ p3(f15(f4(f6(f7(f8(c20))))),X2)
| ~ p3(f14(f4(f9(c19)),c19),X1)
| ~ p2(f6(f7(f8(c20))),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
p2(X1,X1),
p2_2 ).
cnf(c_0_27,negated_conjecture,
p3(f15(f4(f6(f7(f8(c20))))),f12(f15(f4(f6(f7(f8(c20))))),c21)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ p3(f15(f4(f6(f7(f8(c20))))),f12(X1,c21)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN609-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 10:49:55 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.iAPd6A0c2l/E---3.1_10656.p
% 11.06/1.84 # Version: 3.1.0
% 11.06/1.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.06/1.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.06/1.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.06/1.84 # Starting new_bool_3 with 300s (1) cores
% 11.06/1.84 # Starting new_bool_1 with 300s (1) cores
% 11.06/1.84 # Starting sh5l with 300s (1) cores
% 11.06/1.84 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10748 completed with status 0
% 11.06/1.84 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 11.06/1.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.06/1.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.06/1.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.06/1.84 # No SInE strategy applied
% 11.06/1.84 # Search class: FGUNS-FFMS21-DFFFFFNN
% 11.06/1.84 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.06/1.84 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 11.06/1.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.06/1.84 # Starting new_bool_3 with 136s (1) cores
% 11.06/1.84 # Starting new_bool_1 with 136s (1) cores
% 11.06/1.84 # Starting sh5l with 136s (1) cores
% 11.06/1.84 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10753 completed with status 0
% 11.06/1.84 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 11.06/1.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 11.06/1.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.06/1.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.06/1.84 # No SInE strategy applied
% 11.06/1.84 # Search class: FGUNS-FFMS21-DFFFFFNN
% 11.06/1.84 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.06/1.84 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 11.06/1.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.06/1.84 # Preprocessing time : 0.001 s
% 11.06/1.84 # Presaturation interreduction done
% 11.06/1.84
% 11.06/1.84 # Proof found!
% 11.06/1.84 # SZS status Unsatisfiable
% 11.06/1.84 # SZS output start CNFRefutation
% See solution above
% 11.06/1.84 # Parsed axioms : 30
% 11.06/1.84 # Removed by relevancy pruning/SinE : 0
% 11.06/1.84 # Initial clauses : 30
% 11.06/1.84 # Removed in clause preprocessing : 0
% 11.06/1.84 # Initial clauses in saturation : 30
% 11.06/1.84 # Processed clauses : 11063
% 11.06/1.84 # ...of these trivial : 12
% 11.06/1.84 # ...subsumed : 8951
% 11.06/1.84 # ...remaining for further processing : 2100
% 11.06/1.84 # Other redundant clauses eliminated : 0
% 11.06/1.84 # Clauses deleted for lack of memory : 0
% 11.06/1.84 # Backward-subsumed : 77
% 11.06/1.84 # Backward-rewritten : 0
% 11.06/1.84 # Generated clauses : 99606
% 11.06/1.84 # ...of the previous two non-redundant : 94032
% 11.06/1.84 # ...aggressively subsumed : 0
% 11.06/1.84 # Contextual simplify-reflections : 14
% 11.06/1.84 # Paramodulations : 99605
% 11.06/1.84 # Factorizations : 0
% 11.06/1.84 # NegExts : 0
% 11.06/1.84 # Equation resolutions : 0
% 11.06/1.84 # Disequality decompositions : 0
% 11.06/1.84 # Total rewrite steps : 23697
% 11.06/1.84 # ...of those cached : 23649
% 11.06/1.84 # Propositional unsat checks : 0
% 11.06/1.84 # Propositional check models : 0
% 11.06/1.84 # Propositional check unsatisfiable : 0
% 11.06/1.84 # Propositional clauses : 0
% 11.06/1.84 # Propositional clauses after purity: 0
% 11.06/1.84 # Propositional unsat core size : 0
% 11.06/1.84 # Propositional preprocessing time : 0.000
% 11.06/1.84 # Propositional encoding time : 0.000
% 11.06/1.84 # Propositional solver time : 0.000
% 11.06/1.84 # Success case prop preproc time : 0.000
% 11.06/1.84 # Success case prop encoding time : 0.000
% 11.06/1.84 # Success case prop solver time : 0.000
% 11.06/1.84 # Current number of processed clauses : 1992
% 11.06/1.84 # Positive orientable unit clauses : 31
% 11.06/1.84 # Positive unorientable unit clauses: 0
% 11.06/1.84 # Negative unit clauses : 5
% 11.06/1.84 # Non-unit-clauses : 1956
% 11.06/1.84 # Current number of unprocessed clauses: 82923
% 11.06/1.84 # ...number of literals in the above : 320519
% 11.06/1.84 # Current number of archived formulas : 0
% 11.06/1.84 # Current number of archived clauses : 108
% 11.06/1.84 # Clause-clause subsumption calls (NU) : 696892
% 11.06/1.84 # Rec. Clause-clause subsumption calls : 548448
% 11.06/1.84 # Non-unit clause-clause subsumptions : 9016
% 11.06/1.84 # Unit Clause-clause subsumption calls : 830
% 11.06/1.84 # Rewrite failures with RHS unbound : 0
% 11.06/1.84 # BW rewrite match attempts : 29
% 11.06/1.84 # BW rewrite match successes : 0
% 11.06/1.84 # Condensation attempts : 0
% 11.06/1.84 # Condensation successes : 0
% 11.06/1.84 # Termbank termtop insertions : 1672466
% 11.06/1.84 # Search garbage collected termcells : 72
% 11.06/1.84
% 11.06/1.84 # -------------------------------------------------
% 11.06/1.84 # User time : 1.298 s
% 11.06/1.84 # System time : 0.051 s
% 11.06/1.84 # Total time : 1.349 s
% 11.06/1.84 # Maximum resident set size: 1692 pages
% 11.06/1.84
% 11.06/1.84 # -------------------------------------------------
% 11.06/1.84 # User time : 6.613 s
% 11.06/1.84 # System time : 0.075 s
% 11.06/1.84 # Total time : 6.688 s
% 11.06/1.84 # Maximum resident set size: 1724 pages
% 11.06/1.84 % E---3.1 exiting
%------------------------------------------------------------------------------