TSTP Solution File: SYN591-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN591-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 08:00:39 EDT 2024
% Result : Unsatisfiable 2.12s 0.75s
% Output : CNFRefutation 2.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of clauses : 47 ( 16 unt; 8 nHn; 43 RR)
% Number of literals : 105 ( 0 equ; 56 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p2_20,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_20) ).
cnf(p2_22,negated_conjecture,
( p2(f6(X1),f5(X1))
| ~ p12(c14,f4(X1,c17)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_22) ).
cnf(p12_11,negated_conjecture,
p12(c14,f4(c18,c17)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12_11) ).
cnf(p11_27,negated_conjecture,
( p11(c13,f4(c17,f5(X1)))
| p11(c13,f4(f5(X1),c17))
| ~ p12(c14,f4(X1,c17)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_27) ).
cnf(p2_4,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_4) ).
cnf(p11_25,negated_conjecture,
( p11(X1,X2)
| ~ p3(X3,X2)
| ~ p7(X4,X1)
| ~ p11(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_25) ).
cnf(p2_17,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_17) ).
cnf(p3_26,negated_conjecture,
( p3(f4(X1,X2),f4(X3,X4))
| ~ p2(X1,X3)
| ~ p2(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_26) ).
cnf(not_p11_13,negated_conjecture,
~ p11(c13,f4(f6(c18),c17)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_13) ).
cnf(p7_3,negated_conjecture,
p7(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p7_3) ).
cnf(not_p11_12,negated_conjecture,
~ p11(c13,f4(c17,f6(c18))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_12) ).
cnf(c_0_11,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
inference(fof_simplification,[status(thm)],[p2_20]) ).
cnf(c_0_12,negated_conjecture,
( p2(f6(X1),f5(X1))
| ~ p12(c14,f4(X1,c17)) ),
inference(fof_simplification,[status(thm)],[p2_22]) ).
cnf(c_0_13,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
( p2(f6(X1),f5(X1))
| ~ p12(c14,f4(X1,c17)) ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
( p2(X1,f5(X2))
| ~ p12(c14,f4(X2,c17))
| ~ p2(f6(X2),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
p12(c14,f4(c18,c17)),
p12_11 ).
cnf(c_0_17,negated_conjecture,
( p11(c13,f4(c17,f5(X1)))
| p11(c13,f4(f5(X1),c17))
| ~ p12(c14,f4(X1,c17)) ),
inference(fof_simplification,[status(thm)],[p11_27]) ).
cnf(c_0_18,negated_conjecture,
p2(X1,X1),
p2_4 ).
cnf(c_0_19,negated_conjecture,
( p2(X1,f5(c18))
| ~ p2(f6(c18),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( p11(X1,X2)
| ~ p3(X3,X2)
| ~ p7(X4,X1)
| ~ p11(X4,X3) ),
inference(fof_simplification,[status(thm)],[p11_25]) ).
cnf(c_0_21,negated_conjecture,
( p11(c13,f4(c17,f5(X1)))
| p11(c13,f4(f5(X1),c17))
| ~ p12(c14,f4(X1,c17)) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
( p2(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
p2(f6(c18),f5(c18)),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p2(X1,X2) ),
inference(fof_simplification,[status(thm)],[p2_17]) ).
cnf(c_0_25,negated_conjecture,
( p11(X1,X2)
| ~ p3(X3,X2)
| ~ p7(X4,X1)
| ~ p11(X4,X3) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
( p11(c13,f4(c17,f5(c18)))
| p11(c13,f4(f5(c18),c17)) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_27,negated_conjecture,
( p3(f4(X1,X2),f4(X3,X4))
| ~ p2(X1,X3)
| ~ p2(X2,X4) ),
inference(fof_simplification,[status(thm)],[p3_26]) ).
cnf(c_0_28,negated_conjecture,
p2(f5(c18),f6(c18)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p2(X1,X2) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
( p11(c13,f4(c17,f5(c18)))
| p11(X1,X2)
| ~ p3(f4(f5(c18),c17),X2)
| ~ p7(c13,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( p3(f4(X1,X2),f4(X3,X4))
| ~ p2(X1,X3)
| ~ p2(X2,X4) ),
c_0_27 ).
cnf(c_0_32,negated_conjecture,
( p2(X1,f6(c18))
| ~ p2(f5(c18),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( p2(f5(X1),f5(X2))
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( p11(c13,f4(c17,f5(c18)))
| p11(X1,f4(X2,X3))
| ~ p2(f5(c18),X2)
| ~ p2(c17,X3)
| ~ p7(c13,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( p2(f5(X1),f6(c18))
| ~ p2(X1,c18) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
( p11(c13,f4(c17,f5(c18)))
| p11(X1,f4(f6(c18),X2))
| ~ p2(c17,X2)
| ~ p7(c13,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_18])]) ).
cnf(c_0_37,negated_conjecture,
~ p11(c13,f4(f6(c18),c17)),
inference(fof_simplification,[status(thm)],[not_p11_13]) ).
cnf(c_0_38,negated_conjecture,
( p11(c13,f4(c17,f5(c18)))
| p11(X1,f4(f6(c18),c17))
| ~ p7(c13,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_18]) ).
cnf(c_0_39,negated_conjecture,
p7(X1,X1),
p7_3 ).
cnf(c_0_40,negated_conjecture,
~ p11(c13,f4(f6(c18),c17)),
c_0_37 ).
cnf(c_0_41,negated_conjecture,
p11(c13,f4(c17,f5(c18))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_42,negated_conjecture,
~ p11(c13,f4(c17,f6(c18))),
inference(fof_simplification,[status(thm)],[not_p11_12]) ).
cnf(c_0_43,negated_conjecture,
( p11(X1,X2)
| ~ p3(f4(c17,f5(c18)),X2)
| ~ p7(c13,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
~ p11(c13,f4(c17,f6(c18))),
c_0_42 ).
cnf(c_0_45,negated_conjecture,
( p11(X1,f4(X2,X3))
| ~ p2(f5(c18),X3)
| ~ p2(c17,X2)
| ~ p7(c13,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_31]) ).
cnf(c_0_46,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_44,c_0_45]),c_0_28]),c_0_18]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN591-1 : TPTP v8.2.0. Released v2.5.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 15:05:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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/benchmark/theBenchmark.p
% 2.12/0.75 # Version: 3.1.0
% 2.12/0.75 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.12/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.12/0.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.12/0.75 # Starting new_bool_3 with 300s (1) cores
% 2.12/0.75 # Starting new_bool_1 with 300s (1) cores
% 2.12/0.75 # Starting sh5l with 300s (1) cores
% 2.12/0.75 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25578 completed with status 0
% 2.12/0.75 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.12/0.75 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.12/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.12/0.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.12/0.75 # No SInE strategy applied
% 2.12/0.75 # Search class: FGUNM-FFSM21-SFFFFFNN
% 2.12/0.75 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.12/0.75 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 811s (1) cores
% 2.12/0.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.12/0.75 # Starting new_bool_3 with 136s (1) cores
% 2.12/0.75 # Starting new_bool_1 with 136s (1) cores
% 2.12/0.75 # Starting sh5l with 136s (1) cores
% 2.12/0.75 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 25582 completed with status 0
% 2.12/0.75 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 2.12/0.75 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.12/0.75 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.12/0.75 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.12/0.75 # No SInE strategy applied
% 2.12/0.75 # Search class: FGUNM-FFSM21-SFFFFFNN
% 2.12/0.75 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.12/0.75 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 811s (1) cores
% 2.12/0.75 # Preprocessing time : 0.002 s
% 2.12/0.75
% 2.12/0.75 # Proof found!
% 2.12/0.75 # SZS status Unsatisfiable
% 2.12/0.75 # SZS output start CNFRefutation
% See solution above
% 2.12/0.75 # Parsed axioms : 27
% 2.12/0.75 # Removed by relevancy pruning/SinE : 0
% 2.12/0.75 # Initial clauses : 27
% 2.12/0.75 # Removed in clause preprocessing : 0
% 2.12/0.75 # Initial clauses in saturation : 27
% 2.12/0.75 # Processed clauses : 1461
% 2.12/0.75 # ...of these trivial : 2
% 2.12/0.75 # ...subsumed : 826
% 2.12/0.75 # ...remaining for further processing : 633
% 2.12/0.75 # Other redundant clauses eliminated : 0
% 2.12/0.75 # Clauses deleted for lack of memory : 0
% 2.12/0.75 # Backward-subsumed : 39
% 2.12/0.75 # Backward-rewritten : 6
% 2.12/0.75 # Generated clauses : 15299
% 2.12/0.75 # ...of the previous two non-redundant : 14855
% 2.12/0.75 # ...aggressively subsumed : 0
% 2.12/0.75 # Contextual simplify-reflections : 3
% 2.12/0.75 # Paramodulations : 15293
% 2.12/0.75 # Factorizations : 6
% 2.12/0.75 # NegExts : 0
% 2.12/0.75 # Equation resolutions : 0
% 2.12/0.75 # Disequality decompositions : 0
% 2.12/0.75 # Total rewrite steps : 2710
% 2.12/0.75 # ...of those cached : 2688
% 2.12/0.75 # Propositional unsat checks : 0
% 2.12/0.75 # Propositional check models : 0
% 2.12/0.75 # Propositional check unsatisfiable : 0
% 2.12/0.75 # Propositional clauses : 0
% 2.12/0.75 # Propositional clauses after purity: 0
% 2.12/0.75 # Propositional unsat core size : 0
% 2.12/0.75 # Propositional preprocessing time : 0.000
% 2.12/0.75 # Propositional encoding time : 0.000
% 2.12/0.75 # Propositional solver time : 0.000
% 2.12/0.75 # Success case prop preproc time : 0.000
% 2.12/0.75 # Success case prop encoding time : 0.000
% 2.12/0.75 # Success case prop solver time : 0.000
% 2.12/0.75 # Current number of processed clauses : 588
% 2.12/0.75 # Positive orientable unit clauses : 15
% 2.12/0.75 # Positive unorientable unit clauses: 0
% 2.12/0.75 # Negative unit clauses : 3
% 2.12/0.75 # Non-unit-clauses : 570
% 2.12/0.75 # Current number of unprocessed clauses: 13377
% 2.12/0.75 # ...number of literals in the above : 53847
% 2.12/0.75 # Current number of archived formulas : 0
% 2.12/0.75 # Current number of archived clauses : 45
% 2.12/0.75 # Clause-clause subsumption calls (NU) : 128767
% 2.12/0.75 # Rec. Clause-clause subsumption calls : 86823
% 2.12/0.75 # Non-unit clause-clause subsumptions : 852
% 2.12/0.75 # Unit Clause-clause subsumption calls : 42
% 2.12/0.75 # Rewrite failures with RHS unbound : 0
% 2.12/0.75 # BW rewrite match attempts : 5
% 2.12/0.75 # BW rewrite match successes : 1
% 2.12/0.75 # Condensation attempts : 0
% 2.12/0.75 # Condensation successes : 0
% 2.12/0.75 # Termbank termtop insertions : 239554
% 2.12/0.75 # Search garbage collected termcells : 67
% 2.12/0.75
% 2.12/0.75 # -------------------------------------------------
% 2.12/0.75 # User time : 0.233 s
% 2.12/0.75 # System time : 0.010 s
% 2.12/0.75 # Total time : 0.242 s
% 2.12/0.75 # Maximum resident set size: 1680 pages
% 2.12/0.75
% 2.12/0.75 # -------------------------------------------------
% 2.12/0.75 # User time : 1.163 s
% 2.12/0.75 # System time : 0.024 s
% 2.12/0.75 # Total time : 1.187 s
% 2.12/0.75 # Maximum resident set size: 1712 pages
% 2.12/0.75 % E---3.1 exiting
%------------------------------------------------------------------------------