TSTP Solution File: SYN564-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN564-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:06 EDT 2023
% Result : Unsatisfiable 3.52s 0.94s
% Output : CNFRefutation 3.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 19 unt; 0 nHn; 18 RR)
% Number of literals : 61 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p4_9,negated_conjecture,
( p4(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',p4_9) ).
cnf(p4_2,negated_conjecture,
p4(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',p4_2) ).
cnf(p2_17,negated_conjecture,
( p2(f9(X1,X2),f9(X3,X4))
| ~ p2(X1,X3)
| ~ p2(X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',p2_17) ).
cnf(p2_3,negated_conjecture,
p2(f5(f7(X1)),f5(X1)),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',p2_3) ).
cnf(p4_4,negated_conjecture,
p4(f8(X1,X2),f6(X1,f7(X2))),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',p4_4) ).
cnf(p10_14,negated_conjecture,
( p10(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p10(X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',p10_14) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',p2_1) ).
cnf(p2_6,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p4(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',p2_6) ).
cnf(p10_13,negated_conjecture,
( p10(f9(X1,X2),X3)
| ~ p10(X1,f3(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',p10_13) ).
cnf(p10_10,negated_conjecture,
p10(f5(X1),f3(f5(f6(X1,X2)),f5(X2))),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',p10_10) ).
cnf(not_p10_11,negated_conjecture,
~ p10(f9(f5(c11),f5(c12)),f5(f8(c11,c12))),
file('/export/starexec/sandbox2/tmp/tmp.jroLeazSpx/E---3.1_12901.p',not_p10_11) ).
cnf(c_0_11,negated_conjecture,
( p4(X1,X2)
| ~ p4(X3,X1)
| ~ p4(X3,X2) ),
p4_9 ).
cnf(c_0_12,negated_conjecture,
p4(X1,X1),
p4_2 ).
cnf(c_0_13,negated_conjecture,
( p2(f9(X1,X2),f9(X3,X4))
| ~ p2(X1,X3)
| ~ p2(X2,X4) ),
p2_17 ).
cnf(c_0_14,negated_conjecture,
p2(f5(f7(X1)),f5(X1)),
p2_3 ).
cnf(c_0_15,negated_conjecture,
( p4(X1,X2)
| ~ p4(X2,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
p4(f8(X1,X2),f6(X1,f7(X2))),
p4_4 ).
cnf(c_0_17,negated_conjecture,
( p10(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p10(X3,X4) ),
p10_14 ).
cnf(c_0_18,negated_conjecture,
p2(X1,X1),
p2_1 ).
cnf(c_0_19,negated_conjecture,
( p2(f9(X1,f5(f7(X2))),f9(X3,f5(X2)))
| ~ p2(X1,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p4(X1,X2) ),
p2_6 ).
cnf(c_0_21,negated_conjecture,
p4(f6(X1,f7(X2)),f8(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( p10(X1,X2)
| ~ p10(X3,X2)
| ~ p2(X3,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
p2(f9(X1,f5(f7(X2))),f9(X1,f5(X2))),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( p10(f9(X1,X2),X3)
| ~ p10(X1,f3(X3,X2)) ),
p10_13 ).
cnf(c_0_25,negated_conjecture,
p10(f5(X1),f3(f5(f6(X1,X2)),f5(X2))),
p10_10 ).
cnf(c_0_26,negated_conjecture,
p2(f5(f6(X1,f7(X2))),f5(f8(X1,X2))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( p10(f9(X1,f5(X2)),X3)
| ~ p10(f9(X1,f5(f7(X2))),X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
p10(f9(f5(X1),f5(X2)),f5(f6(X1,X2))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( p10(X1,f5(f8(X2,X3)))
| ~ p10(X4,f5(f6(X2,f7(X3))))
| ~ p2(X4,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
p10(f9(f5(X1),f5(X2)),f5(f6(X1,f7(X2)))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( p10(X1,f5(f8(X2,X3)))
| ~ p2(f9(f5(X2),f5(X3)),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
~ p10(f9(f5(c11),f5(c12)),f5(f8(c11,c12))),
not_p10_11 ).
cnf(c_0_33,negated_conjecture,
p10(f9(f5(X1),f5(X2)),f5(f8(X1,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SYN564-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n005.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 18:20:16 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 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.jroLeazSpx/E---3.1_12901.p
% 3.52/0.94 # Version: 3.1pre001
% 3.52/0.94 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.52/0.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.52/0.94 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.52/0.94 # Starting new_bool_3 with 300s (1) cores
% 3.52/0.94 # Starting new_bool_1 with 300s (1) cores
% 3.52/0.94 # Starting sh5l with 300s (1) cores
% 3.52/0.94 # new_bool_1 with pid 12981 completed with status 0
% 3.52/0.94 # Result found by new_bool_1
% 3.52/0.94 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.52/0.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.52/0.94 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.52/0.94 # Starting new_bool_3 with 300s (1) cores
% 3.52/0.94 # Starting new_bool_1 with 300s (1) cores
% 3.52/0.94 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.52/0.94 # Search class: FHUNM-FFSF21-MFFFFFNN
% 3.52/0.94 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.52/0.94 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 3.52/0.94 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 12984 completed with status 0
% 3.52/0.94 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 3.52/0.94 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.52/0.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.52/0.94 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.52/0.94 # Starting new_bool_3 with 300s (1) cores
% 3.52/0.94 # Starting new_bool_1 with 300s (1) cores
% 3.52/0.94 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.52/0.94 # Search class: FHUNM-FFSF21-MFFFFFNN
% 3.52/0.94 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.52/0.94 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 3.52/0.94 # Preprocessing time : 0.001 s
% 3.52/0.94 # Presaturation interreduction done
% 3.52/0.94
% 3.52/0.94 # Proof found!
% 3.52/0.94 # SZS status Unsatisfiable
% 3.52/0.94 # SZS output start CNFRefutation
% See solution above
% 3.52/0.94 # Parsed axioms : 18
% 3.52/0.94 # Removed by relevancy pruning/SinE : 0
% 3.52/0.94 # Initial clauses : 18
% 3.52/0.94 # Removed in clause preprocessing : 0
% 3.52/0.94 # Initial clauses in saturation : 18
% 3.52/0.94 # Processed clauses : 2131
% 3.52/0.94 # ...of these trivial : 911
% 3.52/0.94 # ...subsumed : 0
% 3.52/0.94 # ...remaining for further processing : 1220
% 3.52/0.94 # Other redundant clauses eliminated : 0
% 3.52/0.94 # Clauses deleted for lack of memory : 0
% 3.52/0.94 # Backward-subsumed : 0
% 3.52/0.94 # Backward-rewritten : 1
% 3.52/0.94 # Generated clauses : 42696
% 3.52/0.94 # ...of the previous two non-redundant : 39463
% 3.52/0.94 # ...aggressively subsumed : 0
% 3.52/0.94 # Contextual simplify-reflections : 0
% 3.52/0.94 # Paramodulations : 42696
% 3.52/0.94 # Factorizations : 0
% 3.52/0.94 # NegExts : 0
% 3.52/0.94 # Equation resolutions : 0
% 3.52/0.94 # Total rewrite steps : 4126
% 3.52/0.94 # Propositional unsat checks : 0
% 3.52/0.94 # Propositional check models : 0
% 3.52/0.94 # Propositional check unsatisfiable : 0
% 3.52/0.94 # Propositional clauses : 0
% 3.52/0.94 # Propositional clauses after purity: 0
% 3.52/0.94 # Propositional unsat core size : 0
% 3.52/0.94 # Propositional preprocessing time : 0.000
% 3.52/0.94 # Propositional encoding time : 0.000
% 3.52/0.94 # Propositional solver time : 0.000
% 3.52/0.94 # Success case prop preproc time : 0.000
% 3.52/0.94 # Success case prop encoding time : 0.000
% 3.52/0.94 # Success case prop solver time : 0.000
% 3.52/0.94 # Current number of processed clauses : 1201
% 3.52/0.94 # Positive orientable unit clauses : 915
% 3.52/0.94 # Positive unorientable unit clauses: 0
% 3.52/0.94 # Negative unit clauses : 0
% 3.52/0.94 # Non-unit-clauses : 286
% 3.52/0.94 # Current number of unprocessed clauses: 37368
% 3.52/0.94 # ...number of literals in the above : 40857
% 3.52/0.94 # Current number of archived formulas : 0
% 3.52/0.94 # Current number of archived clauses : 19
% 3.52/0.94 # Clause-clause subsumption calls (NU) : 6041
% 3.52/0.94 # Rec. Clause-clause subsumption calls : 5133
% 3.52/0.94 # Non-unit clause-clause subsumptions : 0
% 3.52/0.94 # Unit Clause-clause subsumption calls : 346
% 3.52/0.94 # Rewrite failures with RHS unbound : 0
% 3.52/0.94 # BW rewrite match attempts : 8026
% 3.52/0.94 # BW rewrite match successes : 1
% 3.52/0.94 # Condensation attempts : 0
% 3.52/0.94 # Condensation successes : 0
% 3.52/0.94 # Termbank termtop insertions : 701059
% 3.52/0.94
% 3.52/0.94 # -------------------------------------------------
% 3.52/0.94 # User time : 0.389 s
% 3.52/0.94 # System time : 0.020 s
% 3.52/0.94 # Total time : 0.409 s
% 3.52/0.94 # Maximum resident set size: 1624 pages
% 3.52/0.94
% 3.52/0.94 # -------------------------------------------------
% 3.52/0.94 # User time : 0.390 s
% 3.52/0.94 # System time : 0.023 s
% 3.52/0.94 # Total time : 0.413 s
% 3.52/0.94 # Maximum resident set size: 1688 pages
% 3.52/0.94 % E---3.1 exiting
%------------------------------------------------------------------------------