TSTP Solution File: SYN587-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN587-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:59 EDT 2024
% Result : Unsatisfiable 8.01s 1.53s
% Output : CNFRefutation 8.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 13 unt; 0 nHn; 22 RR)
% Number of literals : 55 ( 0 equ; 32 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p15_17,negated_conjecture,
( p15(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p15(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p15_17) ).
cnf(p15_18,negated_conjecture,
p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p15_18) ).
cnf(p2_20,negated_conjecture,
( p2(f4(X1,X2),f4(X3,X4))
| ~ p2(X1,X3)
| ~ p3(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_20) ).
cnf(p3_15,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_15) ).
cnf(p3_3,negated_conjecture,
p3(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_3) ).
cnf(not_p15_19,negated_conjecture,
~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p15_19) ).
cnf(p2_4,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_4) ).
cnf(p3_5,negated_conjecture,
p3(c21,c19),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_5) ).
cnf(c_0_8,negated_conjecture,
( p15(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p15(X3,X4) ),
inference(fof_simplification,[status(thm)],[p15_17]) ).
cnf(c_0_9,negated_conjecture,
( p15(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p15(X3,X4) ),
c_0_8 ).
cnf(c_0_10,negated_conjecture,
p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20),
p15_18 ).
cnf(c_0_11,negated_conjecture,
( p2(f4(X1,X2),f4(X3,X4))
| ~ p2(X1,X3)
| ~ p3(X2,X4) ),
inference(fof_simplification,[status(thm)],[p2_20]) ).
cnf(c_0_12,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
inference(fof_simplification,[status(thm)],[p3_15]) ).
cnf(c_0_13,negated_conjecture,
( p15(X1,X2)
| ~ p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),X1)
| ~ p2(c20,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( p2(f4(X1,X2),f4(X3,X4))
| ~ p2(X1,X3)
| ~ p3(X2,X4) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
c_0_12 ).
cnf(c_0_16,negated_conjecture,
p3(X1,X1),
p3_3 ).
cnf(c_0_17,negated_conjecture,
~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20),
inference(fof_simplification,[status(thm)],[not_p15_19]) ).
cnf(c_0_18,negated_conjecture,
( p15(f4(X1,X2),X3)
| ~ p2(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),X1)
| ~ p2(c20,X3)
| ~ p3(c19,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
p2(X1,X1),
p2_4 ).
cnf(c_0_20,negated_conjecture,
( p3(X1,X2)
| ~ p3(X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
p3(c21,c19),
p3_5 ).
cnf(c_0_22,negated_conjecture,
~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
( p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),X1),X2)
| ~ p2(c20,X2)
| ~ p3(c19,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
p3(c19,c21),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN587-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 14:23:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 8.01/1.53 # Version: 3.1.0
% 8.01/1.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.01/1.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.01/1.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.01/1.53 # Starting new_bool_3 with 300s (1) cores
% 8.01/1.53 # Starting new_bool_1 with 300s (1) cores
% 8.01/1.53 # Starting sh5l with 300s (1) cores
% 8.01/1.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31966 completed with status 0
% 8.01/1.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.01/1.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.01/1.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.01/1.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.01/1.53 # No SInE strategy applied
% 8.01/1.53 # Search class: FGUNM-FFMF21-DFFFFFNN
% 8.01/1.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.01/1.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 8.01/1.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.01/1.53 # Starting new_bool_3 with 136s (1) cores
% 8.01/1.53 # Starting new_bool_1 with 136s (1) cores
% 8.01/1.53 # Starting sh5l with 136s (1) cores
% 8.01/1.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31971 completed with status 0
% 8.01/1.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.01/1.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.01/1.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.01/1.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.01/1.53 # No SInE strategy applied
% 8.01/1.53 # Search class: FGUNM-FFMF21-DFFFFFNN
% 8.01/1.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.01/1.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 8.01/1.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.01/1.53 # Preprocessing time : 0.001 s
% 8.01/1.53 # Presaturation interreduction done
% 8.01/1.53
% 8.01/1.53 # Proof found!
% 8.01/1.53 # SZS status Unsatisfiable
% 8.01/1.53 # SZS output start CNFRefutation
% See solution above
% 8.01/1.53 # Parsed axioms : 26
% 8.01/1.53 # Removed by relevancy pruning/SinE : 0
% 8.01/1.53 # Initial clauses : 26
% 8.01/1.53 # Removed in clause preprocessing : 0
% 8.01/1.53 # Initial clauses in saturation : 26
% 8.01/1.53 # Processed clauses : 8344
% 8.01/1.53 # ...of these trivial : 79
% 8.01/1.53 # ...subsumed : 6691
% 8.01/1.53 # ...remaining for further processing : 1574
% 8.01/1.53 # Other redundant clauses eliminated : 0
% 8.01/1.53 # Clauses deleted for lack of memory : 0
% 8.01/1.53 # Backward-subsumed : 16
% 8.01/1.53 # Backward-rewritten : 0
% 8.01/1.53 # Generated clauses : 80721
% 8.01/1.53 # ...of the previous two non-redundant : 68598
% 8.01/1.53 # ...aggressively subsumed : 0
% 8.01/1.53 # Contextual simplify-reflections : 1
% 8.01/1.53 # Paramodulations : 80721
% 8.01/1.53 # Factorizations : 0
% 8.01/1.53 # NegExts : 0
% 8.01/1.53 # Equation resolutions : 0
% 8.01/1.53 # Disequality decompositions : 0
% 8.01/1.53 # Total rewrite steps : 27903
% 8.01/1.53 # ...of those cached : 27809
% 8.01/1.53 # Propositional unsat checks : 0
% 8.01/1.53 # Propositional check models : 0
% 8.01/1.53 # Propositional check unsatisfiable : 0
% 8.01/1.53 # Propositional clauses : 0
% 8.01/1.53 # Propositional clauses after purity: 0
% 8.01/1.53 # Propositional unsat core size : 0
% 8.01/1.53 # Propositional preprocessing time : 0.000
% 8.01/1.53 # Propositional encoding time : 0.000
% 8.01/1.53 # Propositional solver time : 0.000
% 8.01/1.53 # Success case prop preproc time : 0.000
% 8.01/1.53 # Success case prop encoding time : 0.000
% 8.01/1.53 # Success case prop solver time : 0.000
% 8.01/1.53 # Current number of processed clauses : 1532
% 8.01/1.53 # Positive orientable unit clauses : 71
% 8.01/1.53 # Positive unorientable unit clauses: 0
% 8.01/1.53 # Negative unit clauses : 5
% 8.01/1.53 # Non-unit-clauses : 1456
% 8.01/1.53 # Current number of unprocessed clauses: 60240
% 8.01/1.53 # ...number of literals in the above : 200632
% 8.01/1.53 # Current number of archived formulas : 0
% 8.01/1.53 # Current number of archived clauses : 42
% 8.01/1.53 # Clause-clause subsumption calls (NU) : 746368
% 8.01/1.53 # Rec. Clause-clause subsumption calls : 622343
% 8.01/1.53 # Non-unit clause-clause subsumptions : 6708
% 8.01/1.53 # Unit Clause-clause subsumption calls : 134
% 8.01/1.53 # Rewrite failures with RHS unbound : 0
% 8.01/1.53 # BW rewrite match attempts : 123
% 8.01/1.53 # BW rewrite match successes : 0
% 8.01/1.53 # Condensation attempts : 0
% 8.01/1.53 # Condensation successes : 0
% 8.01/1.53 # Termbank termtop insertions : 1122082
% 8.01/1.53 # Search garbage collected termcells : 71
% 8.01/1.53
% 8.01/1.53 # -------------------------------------------------
% 8.01/1.53 # User time : 0.978 s
% 8.01/1.53 # System time : 0.037 s
% 8.01/1.53 # Total time : 1.014 s
% 8.01/1.53 # Maximum resident set size: 1688 pages
% 8.01/1.53
% 8.01/1.53 # -------------------------------------------------
% 8.01/1.53 # User time : 4.988 s
% 8.01/1.53 # System time : 0.074 s
% 8.01/1.53 # Total time : 5.062 s
% 8.01/1.53 # Maximum resident set size: 1720 pages
% 8.01/1.53 % E---3.1 exiting
% 8.01/1.53 % E exiting
%------------------------------------------------------------------------------