TSTP Solution File: SYN569-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN569-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Tue May 21 07:46:56 EDT 2024
% Result : Unsatisfiable 0.78s 0.60s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 12 unt; 0 nHn; 40 RR)
% Number of literals : 101 ( 0 equ; 63 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p2_11,negated_conjecture,
( p2(X1,X2)
| ~ p9(X3,X1,X4)
| ~ p9(X3,X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_11) ).
cnf(p2_10,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_10) ).
cnf(p9_6,negated_conjecture,
p9(c13,c15,c14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_6) ).
cnf(p9_12,negated_conjecture,
( p9(c13,f3(X1),X1)
| ~ p10(X1,c12)
| ~ p10(c11,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_12) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_1) ).
cnf(p2_16,negated_conjecture,
( p2(f4(X1,X2),f4(X3,X4))
| ~ p2(X1,X3)
| ~ p2(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_16) ).
cnf(p10_7,negated_conjecture,
( p10(X1,X2)
| ~ p8(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_7) ).
cnf(p2_15,negated_conjecture,
p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_15) ).
cnf(p8_3,negated_conjecture,
p8(c14,c12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_3) ).
cnf(not_p8_20,negated_conjecture,
( ~ p8(X1,c12)
| ~ p8(c11,X1)
| ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p8_20) ).
cnf(p8_5,negated_conjecture,
p8(c11,c14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_5) ).
cnf(c_0_11,negated_conjecture,
( p2(X1,X2)
| ~ p9(X3,X1,X4)
| ~ p9(X3,X2,X4) ),
inference(fof_simplification,[status(thm)],[p2_11]) ).
cnf(c_0_12,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
inference(fof_simplification,[status(thm)],[p2_10]) ).
cnf(c_0_13,negated_conjecture,
( p2(X1,X2)
| ~ p9(X3,X1,X4)
| ~ p9(X3,X2,X4) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
p9(c13,c15,c14),
p9_6 ).
cnf(c_0_15,negated_conjecture,
( p9(c13,f3(X1),X1)
| ~ p10(X1,c12)
| ~ p10(c11,X1) ),
inference(fof_simplification,[status(thm)],[p9_12]) ).
cnf(c_0_16,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
p2(X1,X1),
p2_1 ).
cnf(c_0_18,negated_conjecture,
( p2(X1,c15)
| ~ p9(c13,X1,c14) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( p9(c13,f3(X1),X1)
| ~ p10(X1,c12)
| ~ p10(c11,X1) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
( p2(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( p2(f3(c14),c15)
| ~ p10(c14,c12)
| ~ p10(c11,c14) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( p2(c15,f3(c14))
| ~ p10(c14,c12)
| ~ p10(c11,c14) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( p2(f4(X1,X2),f4(X3,X4))
| ~ p2(X1,X3)
| ~ p2(X2,X4) ),
inference(fof_simplification,[status(thm)],[p2_16]) ).
cnf(c_0_24,negated_conjecture,
( p2(X1,f3(c14))
| ~ p10(c14,c12)
| ~ p10(c11,c14)
| ~ p2(c15,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( p10(X1,X2)
| ~ p8(X1,X2) ),
inference(fof_simplification,[status(thm)],[p10_7]) ).
cnf(c_0_26,negated_conjecture,
( p2(f4(X1,X2),f4(X3,X4))
| ~ p2(X1,X3)
| ~ p2(X2,X4) ),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
p2_15 ).
cnf(c_0_28,negated_conjecture,
( p2(X1,f3(c14))
| ~ p10(c14,c12)
| ~ p10(c11,c14)
| ~ p2(c15,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( p10(X1,X2)
| ~ p8(X1,X2) ),
c_0_25 ).
cnf(c_0_30,negated_conjecture,
p8(c14,c12),
p8_3 ).
cnf(c_0_31,negated_conjecture,
( ~ p8(X1,c12)
| ~ p8(c11,X1)
| ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X1))) ),
inference(fof_simplification,[status(thm)],[not_p8_20]) ).
cnf(c_0_32,negated_conjecture,
( p2(X1,f4(X2,X3))
| ~ p2(f4(X4,X5),X1)
| ~ p2(X5,X3)
| ~ p2(X4,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
p2(f4(f5(c12,c11),c15),f5(f7(c13,c12),f7(c13,c11))),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( p2(X1,f3(c14))
| ~ p10(c11,c14)
| ~ p2(c15,X2)
| ~ p2(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
p8(c11,c14),
p8_5 ).
cnf(c_0_36,negated_conjecture,
( ~ p8(X1,c12)
| ~ p8(c11,X1)
| ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X1))) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
( p2(f5(f7(c13,c12),f7(c13,c11)),f4(X1,X2))
| ~ p2(f5(c12,c11),X1)
| ~ p2(c15,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( p2(X1,f3(c14))
| ~ p2(c15,X2)
| ~ p2(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_35])]) ).
cnf(c_0_39,negated_conjecture,
( ~ p8(X1,c12)
| ~ p8(c11,X1)
| ~ p2(c15,f3(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17])]) ).
cnf(c_0_40,negated_conjecture,
( p2(X1,f3(c14))
| ~ p2(c15,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_17]) ).
cnf(c_0_41,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_39,c_0_40]),c_0_30]),c_0_35]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN569-1 : TPTP v8.2.0. Released v2.5.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 14:40:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/0.60 # Version: 3.1.0
% 0.78/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.78/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.78/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.78/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.78/0.60 # Starting sh5l with 300s (1) cores
% 0.78/0.60 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29970 completed with status 0
% 0.78/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.78/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.78/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.78/0.60 # No SInE strategy applied
% 0.78/0.60 # Search class: FHHNS-FFSS21-SFFFFFNN
% 0.78/0.60 # partial match(1): FHHNS-FFSF21-SFFFFFNN
% 0.78/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.78/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.78/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.78/0.60 # Starting new_bool_3 with 136s (1) cores
% 0.78/0.60 # Starting new_bool_1 with 136s (1) cores
% 0.78/0.60 # Starting sh5l with 136s (1) cores
% 0.78/0.60 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29975 completed with status 0
% 0.78/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.78/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.78/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.78/0.60 # No SInE strategy applied
% 0.78/0.60 # Search class: FHHNS-FFSS21-SFFFFFNN
% 0.78/0.60 # partial match(1): FHHNS-FFSF21-SFFFFFNN
% 0.78/0.60 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.78/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.78/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.78/0.60 # Preprocessing time : 0.001 s
% 0.78/0.60 # Presaturation interreduction done
% 0.78/0.60
% 0.78/0.60 # Proof found!
% 0.78/0.60 # SZS status Unsatisfiable
% 0.78/0.60 # SZS output start CNFRefutation
% See solution above
% 0.78/0.60 # Parsed axioms : 20
% 0.78/0.60 # Removed by relevancy pruning/SinE : 0
% 0.78/0.60 # Initial clauses : 20
% 0.78/0.60 # Removed in clause preprocessing : 0
% 0.78/0.60 # Initial clauses in saturation : 20
% 0.78/0.60 # Processed clauses : 1031
% 0.78/0.60 # ...of these trivial : 2
% 0.78/0.60 # ...subsumed : 641
% 0.78/0.60 # ...remaining for further processing : 388
% 0.78/0.60 # Other redundant clauses eliminated : 0
% 0.78/0.60 # Clauses deleted for lack of memory : 0
% 0.78/0.60 # Backward-subsumed : 72
% 0.78/0.60 # Backward-rewritten : 1
% 0.78/0.60 # Generated clauses : 4523
% 0.78/0.60 # ...of the previous two non-redundant : 4077
% 0.78/0.60 # ...aggressively subsumed : 0
% 0.78/0.60 # Contextual simplify-reflections : 6
% 0.78/0.60 # Paramodulations : 4523
% 0.78/0.60 # Factorizations : 0
% 0.78/0.60 # NegExts : 0
% 0.78/0.60 # Equation resolutions : 0
% 0.78/0.60 # Disequality decompositions : 0
% 0.78/0.60 # Total rewrite steps : 821
% 0.78/0.60 # ...of those cached : 800
% 0.78/0.60 # Propositional unsat checks : 0
% 0.78/0.60 # Propositional check models : 0
% 0.78/0.60 # Propositional check unsatisfiable : 0
% 0.78/0.60 # Propositional clauses : 0
% 0.78/0.60 # Propositional clauses after purity: 0
% 0.78/0.60 # Propositional unsat core size : 0
% 0.78/0.60 # Propositional preprocessing time : 0.000
% 0.78/0.60 # Propositional encoding time : 0.000
% 0.78/0.60 # Propositional solver time : 0.000
% 0.78/0.60 # Success case prop preproc time : 0.000
% 0.78/0.60 # Success case prop encoding time : 0.000
% 0.78/0.60 # Success case prop solver time : 0.000
% 0.78/0.60 # Current number of processed clauses : 295
% 0.78/0.60 # Positive orientable unit clauses : 12
% 0.78/0.60 # Positive unorientable unit clauses: 0
% 0.78/0.60 # Negative unit clauses : 0
% 0.78/0.60 # Non-unit-clauses : 283
% 0.78/0.60 # Current number of unprocessed clauses: 2943
% 0.78/0.60 # ...number of literals in the above : 12105
% 0.78/0.60 # Current number of archived formulas : 0
% 0.78/0.60 # Current number of archived clauses : 93
% 0.78/0.60 # Clause-clause subsumption calls (NU) : 45450
% 0.78/0.60 # Rec. Clause-clause subsumption calls : 29020
% 0.78/0.60 # Non-unit clause-clause subsumptions : 714
% 0.78/0.60 # Unit Clause-clause subsumption calls : 272
% 0.78/0.60 # Rewrite failures with RHS unbound : 0
% 0.78/0.60 # BW rewrite match attempts : 3
% 0.78/0.60 # BW rewrite match successes : 2
% 0.78/0.60 # Condensation attempts : 0
% 0.78/0.60 # Condensation successes : 0
% 0.78/0.60 # Termbank termtop insertions : 64650
% 0.78/0.60 # Search garbage collected termcells : 72
% 0.78/0.60
% 0.78/0.60 # -------------------------------------------------
% 0.78/0.60 # User time : 0.102 s
% 0.78/0.60 # System time : 0.004 s
% 0.78/0.60 # Total time : 0.106 s
% 0.78/0.60 # Maximum resident set size: 1692 pages
% 0.78/0.60
% 0.78/0.60 # -------------------------------------------------
% 0.78/0.60 # User time : 0.493 s
% 0.78/0.60 # System time : 0.016 s
% 0.78/0.60 # Total time : 0.510 s
% 0.78/0.60 # Maximum resident set size: 1708 pages
% 0.78/0.60 % E---3.1 exiting
% 0.78/0.60 % E exiting
%------------------------------------------------------------------------------