TSTP Solution File: SYN570-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN570-1 : TPTP v8.2.0. 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 : Tue May 21 07:46:56 EDT 2024
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 19 unt; 0 nHn; 29 RR)
% Number of literals : 68 ( 0 equ; 34 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p3_17,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_17) ).
cnf(p2_18,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_18) ).
cnf(p3_9,negated_conjecture,
p3(f4(f5(X1)),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_9) ).
cnf(p3_13,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_13) ).
cnf(p2_5,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_5) ).
cnf(p9_19,negated_conjecture,
( p9(X1,X2)
| ~ p7(X3,X2)
| ~ p9(X4,X3)
| ~ p3(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_19) ).
cnf(p2_8,negated_conjecture,
p2(c12,f5(c15)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_8) ).
cnf(p9_7,negated_conjecture,
p9(c15,f8(c13)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_7) ).
cnf(p3_4,negated_conjecture,
p3(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_4) ).
cnf(not_p9_10,negated_conjecture,
~ p9(f4(c12),f8(c13)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p9_10) ).
cnf(p7_2,negated_conjecture,
p7(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p7_2) ).
cnf(c_0_11,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
inference(fof_simplification,[status(thm)],[p3_17]) ).
cnf(c_0_12,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
inference(fof_simplification,[status(thm)],[p2_18]) ).
cnf(c_0_13,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
p3(f4(f5(X1)),X1),
p3_9 ).
cnf(c_0_15,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
inference(fof_simplification,[status(thm)],[p3_13]) ).
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_5 ).
cnf(c_0_18,negated_conjecture,
( p9(X1,X2)
| ~ p7(X3,X2)
| ~ p9(X4,X3)
| ~ p3(X4,X1) ),
inference(fof_simplification,[status(thm)],[p9_19]) ).
cnf(c_0_19,negated_conjecture,
( p3(X1,X2)
| ~ p3(f4(f5(X2)),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( p3(f4(X1),f4(X2))
| ~ p2(X1,X2) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
( p2(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
p2(c12,f5(c15)),
p2_8 ).
cnf(c_0_23,negated_conjecture,
( p9(X1,X2)
| ~ p7(X3,X2)
| ~ p9(X4,X3)
| ~ p3(X4,X1) ),
c_0_18 ).
cnf(c_0_24,negated_conjecture,
p9(c15,f8(c13)),
p9_7 ).
cnf(c_0_25,negated_conjecture,
p3(X1,X1),
p3_4 ).
cnf(c_0_26,negated_conjecture,
( p3(f4(X1),X2)
| ~ p2(f5(X2),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
p2(f5(c15),c12),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
~ p9(f4(c12),f8(c13)),
inference(fof_simplification,[status(thm)],[not_p9_10]) ).
cnf(c_0_29,negated_conjecture,
( p9(X1,X2)
| ~ p3(c15,X1)
| ~ p7(f8(c13),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
p7(X1,X1),
p7_2 ).
cnf(c_0_31,negated_conjecture,
( p3(X1,X2)
| ~ p3(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
p3(f4(c12),c15),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
~ p9(f4(c12),f8(c13)),
c_0_28 ).
cnf(c_0_34,negated_conjecture,
( p9(X1,f8(c13))
| ~ p3(c15,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
p3(c15,f4(c12)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SYN570-1 : TPTP v8.2.0. Released v2.5.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n012.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 15:26:38 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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/benchmark/theBenchmark.p
% 0.14/0.41 # Version: 3.1.0
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12542 completed with status 0
% 0.14/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FHUNM-FFSS11-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 # Starting sh5l with 136s (1) cores
% 0.14/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12549 completed with status 0
% 0.14/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # No SInE strategy applied
% 0.14/0.41 # Search class: FHUNM-FFSS11-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Unsatisfiable
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 20
% 0.14/0.41 # Removed by relevancy pruning/SinE : 0
% 0.14/0.41 # Initial clauses : 20
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 20
% 0.14/0.41 # Processed clauses : 88
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 8
% 0.14/0.41 # ...remaining for further processing : 80
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 1
% 0.14/0.41 # Backward-rewritten : 0
% 0.14/0.41 # Generated clauses : 148
% 0.14/0.41 # ...of the previous two non-redundant : 94
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 148
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 66
% 0.14/0.41 # ...of those cached : 46
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 59
% 0.14/0.41 # Positive orientable unit clauses : 17
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 1
% 0.14/0.41 # Non-unit-clauses : 41
% 0.14/0.41 # Current number of unprocessed clauses: 46
% 0.14/0.41 # ...number of literals in the above : 108
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 21
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 136
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 130
% 0.14/0.41 # Non-unit clause-clause subsumptions : 9
% 0.14/0.41 # Unit Clause-clause subsumption calls : 0
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 4
% 0.14/0.41 # BW rewrite match successes : 0
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 2125
% 0.14/0.41 # Search garbage collected termcells : 52
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.006 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.006 s
% 0.14/0.41 # Maximum resident set size: 1656 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.020 s
% 0.14/0.41 # System time : 0.007 s
% 0.14/0.41 # Total time : 0.027 s
% 0.14/0.41 # Maximum resident set size: 1700 pages
% 0.14/0.41 % E---3.1 exiting
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------