TSTP Solution File: SYN610-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN610-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:47:04 EDT 2024
% Result : Unsatisfiable 15.37s 2.40s
% Output : CNFRefutation 15.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 14 unt; 0 nHn; 27 RR)
% Number of literals : 63 ( 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 : 58 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p17_20,negated_conjecture,
( p17(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p17(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p17_20) ).
cnf(p2_2,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_2) ).
cnf(p2_12,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p3(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_12) ).
cnf(p3_19,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_19) ).
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/benchmark/theBenchmark.p',p17_29) ).
cnf(p3_24,negated_conjecture,
( p3(f10(X1,X2),f10(X3,X4))
| ~ p3(X1,X3)
| ~ p3(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_24) ).
cnf(p3_4,negated_conjecture,
p3(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',p3_27) ).
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,
p2(X1,X1),
p2_2 ).
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,
( p17(X1,X2)
| ~ p17(X3,X2)
| ~ p2(X3,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p3(X1,X2) ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
inference(fof_simplification,[status(thm)],[p3_19]) ).
cnf(c_0_16,negated_conjecture,
( p17(f9(X1),X2)
| ~ p17(f9(X3),X2)
| ~ p3(X3,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,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_18,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_19,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
p3(X1,X1),
p3_4 ).
cnf(c_0_21,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_22,negated_conjecture,
( p17(f9(X1),f6(f7(f8(c20))))
| ~ p3(f10(f14(f4(f9(c19)),c19),f15(f4(f6(f7(f8(c20)))))),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( p3(f10(X1,X2),f10(X3,X4))
| ~ p3(X1,X3)
| ~ p3(X2,X4) ),
c_0_18 ).
cnf(c_0_24,negated_conjecture,
( p3(X1,X2)
| ~ p3(X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
p3(f12(f15(f4(f6(f7(f8(c20))))),c21),f15(f4(f6(f7(f8(c20)))))),
p3_27 ).
cnf(c_0_26,negated_conjecture,
~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
c_0_21 ).
cnf(c_0_27,negated_conjecture,
( p17(f9(f10(X1,X2)),f6(f7(f8(c20))))
| ~ p3(f15(f4(f6(f7(f8(c20))))),X2)
| ~ p3(f14(f4(f9(c19)),c19),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
p3(f15(f4(f6(f7(f8(c20))))),f12(f15(f4(f6(f7(f8(c20))))),c21)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
~ p3(f15(f4(f6(f7(f8(c20))))),f12(X1,c21)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN610-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 14:32:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 15.37/2.40 # Version: 3.1.0
% 15.37/2.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.37/2.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.37/2.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.37/2.40 # Starting new_bool_3 with 300s (1) cores
% 15.37/2.40 # Starting new_bool_1 with 300s (1) cores
% 15.37/2.40 # Starting sh5l with 300s (1) cores
% 15.37/2.40 # sh5l with pid 24228 completed with status 0
% 15.37/2.40 # Result found by sh5l
% 15.37/2.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.37/2.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.37/2.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.37/2.40 # Starting new_bool_3 with 300s (1) cores
% 15.37/2.40 # Starting new_bool_1 with 300s (1) cores
% 15.37/2.40 # Starting sh5l with 300s (1) cores
% 15.37/2.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 15.37/2.40 # Search class: FGUNS-FFMS21-DFFFFFNN
% 15.37/2.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 15.37/2.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 15.37/2.40 # SAT001_MinMin_p005000_rr_RG with pid 24236 completed with status 0
% 15.37/2.40 # Result found by SAT001_MinMin_p005000_rr_RG
% 15.37/2.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.37/2.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.37/2.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.37/2.40 # Starting new_bool_3 with 300s (1) cores
% 15.37/2.40 # Starting new_bool_1 with 300s (1) cores
% 15.37/2.40 # Starting sh5l with 300s (1) cores
% 15.37/2.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 15.37/2.40 # Search class: FGUNS-FFMS21-DFFFFFNN
% 15.37/2.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 15.37/2.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 15.37/2.40 # Preprocessing time : 0.001 s
% 15.37/2.40 # Presaturation interreduction done
% 15.37/2.40
% 15.37/2.40 # Proof found!
% 15.37/2.40 # SZS status Unsatisfiable
% 15.37/2.40 # SZS output start CNFRefutation
% See solution above
% 15.37/2.40 # Parsed axioms : 30
% 15.37/2.40 # Removed by relevancy pruning/SinE : 0
% 15.37/2.40 # Initial clauses : 30
% 15.37/2.40 # Removed in clause preprocessing : 0
% 15.37/2.40 # Initial clauses in saturation : 30
% 15.37/2.40 # Processed clauses : 10095
% 15.37/2.40 # ...of these trivial : 21
% 15.37/2.40 # ...subsumed : 6323
% 15.37/2.40 # ...remaining for further processing : 3751
% 15.37/2.40 # Other redundant clauses eliminated : 0
% 15.37/2.40 # Clauses deleted for lack of memory : 0
% 15.37/2.40 # Backward-subsumed : 30
% 15.37/2.40 # Backward-rewritten : 0
% 15.37/2.40 # Generated clauses : 93688
% 15.37/2.40 # ...of the previous two non-redundant : 89849
% 15.37/2.40 # ...aggressively subsumed : 0
% 15.37/2.40 # Contextual simplify-reflections : 68
% 15.37/2.40 # Paramodulations : 93687
% 15.37/2.40 # Factorizations : 0
% 15.37/2.40 # NegExts : 0
% 15.37/2.40 # Equation resolutions : 0
% 15.37/2.40 # Disequality decompositions : 0
% 15.37/2.40 # Total rewrite steps : 13368
% 15.37/2.40 # ...of those cached : 13326
% 15.37/2.40 # Propositional unsat checks : 0
% 15.37/2.40 # Propositional check models : 0
% 15.37/2.40 # Propositional check unsatisfiable : 0
% 15.37/2.40 # Propositional clauses : 0
% 15.37/2.40 # Propositional clauses after purity: 0
% 15.37/2.40 # Propositional unsat core size : 0
% 15.37/2.40 # Propositional preprocessing time : 0.000
% 15.37/2.40 # Propositional encoding time : 0.000
% 15.37/2.40 # Propositional solver time : 0.000
% 15.37/2.40 # Success case prop preproc time : 0.000
% 15.37/2.40 # Success case prop encoding time : 0.000
% 15.37/2.40 # Success case prop solver time : 0.000
% 15.37/2.40 # Current number of processed clauses : 3690
% 15.37/2.40 # Positive orientable unit clauses : 29
% 15.37/2.40 # Positive unorientable unit clauses: 0
% 15.37/2.40 # Negative unit clauses : 5
% 15.37/2.40 # Non-unit-clauses : 3656
% 15.37/2.40 # Current number of unprocessed clauses: 79768
% 15.37/2.40 # ...number of literals in the above : 477582
% 15.37/2.40 # Current number of archived formulas : 0
% 15.37/2.40 # Current number of archived clauses : 61
% 15.37/2.40 # Clause-clause subsumption calls (NU) : 1997577
% 15.37/2.40 # Rec. Clause-clause subsumption calls : 368427
% 15.37/2.40 # Non-unit clause-clause subsumptions : 6414
% 15.37/2.40 # Unit Clause-clause subsumption calls : 2772
% 15.37/2.40 # Rewrite failures with RHS unbound : 0
% 15.37/2.40 # BW rewrite match attempts : 29
% 15.37/2.40 # BW rewrite match successes : 4
% 15.37/2.40 # Condensation attempts : 0
% 15.37/2.40 # Condensation successes : 0
% 15.37/2.40 # Termbank termtop insertions : 2712703
% 15.37/2.40 # Search garbage collected termcells : 72
% 15.37/2.40
% 15.37/2.40 # -------------------------------------------------
% 15.37/2.40 # User time : 1.854 s
% 15.37/2.40 # System time : 0.051 s
% 15.37/2.40 # Total time : 1.905 s
% 15.37/2.40 # Maximum resident set size: 1768 pages
% 15.37/2.40
% 15.37/2.40 # -------------------------------------------------
% 15.37/2.40 # User time : 1.855 s
% 15.37/2.40 # System time : 0.054 s
% 15.37/2.40 # Total time : 1.909 s
% 15.37/2.40 # Maximum resident set size: 1756 pages
% 15.37/2.40 % E---3.1 exiting
% 15.37/2.40 % E exiting
%------------------------------------------------------------------------------