TSTP Solution File: SYN193-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN193-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:14:03 EDT 2023
% Result : Unsatisfiable 0.59s 0.59s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of clauses : 60 ( 29 unt; 0 nHn; 46 RR)
% Number of literals : 120 ( 0 equ; 64 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 87 ( 41 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',axiom_14) ).
cnf(rule_029,axiom,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_029) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',axiom_5) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_133) ).
cnf(rule_176,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_176) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',axiom_19) ).
cnf(rule_240,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_240) ).
cnf(rule_258,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_258) ).
cnf(rule_298,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_298) ).
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_124) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',axiom_1) ).
cnf(rule_117,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_117) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',axiom_28) ).
cnf(axiom_18,axiom,
p0(c,b),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',axiom_18) ).
cnf(prove_this,negated_conjecture,
~ r4(b),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',prove_this) ).
cnf(rule_188,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',rule_188) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p',axiom_20) ).
cnf(c_0_20,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_21,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_22,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_23,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_24,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
s1(b),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
rule_029 ).
cnf(c_0_27,axiom,
s0(b),
axiom_5 ).
cnf(c_0_28,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_29,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
rule_176 ).
cnf(c_0_31,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_23]),c_0_27])]) ).
cnf(c_0_32,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_34,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
rule_240 ).
cnf(c_0_35,plain,
p2(X1,b,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
rule_258 ).
cnf(c_0_37,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
rule_298 ).
cnf(c_0_39,plain,
n3(X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ l2(X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_29])]) ).
cnf(c_0_41,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_37,c_0_23]) ).
cnf(c_0_42,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
rule_124 ).
cnf(c_0_43,axiom,
s0(d),
axiom_1 ).
cnf(c_0_44,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
rule_117 ).
cnf(c_0_45,axiom,
k0(e),
axiom_28 ).
cnf(c_0_46,plain,
( r4(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_47,plain,
( q3(X1,X1)
| ~ r2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_48,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_49,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_43]),c_0_45])]) ).
cnf(c_0_50,plain,
( r4(X1)
| ~ r2(X2)
| ~ p0(X3,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,axiom,
p0(c,b),
axiom_18 ).
cnf(c_0_52,negated_conjecture,
~ r4(b),
prove_this ).
cnf(c_0_53,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
rule_188 ).
cnf(c_0_54,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_21]),c_0_49])]) ).
cnf(c_0_55,plain,
~ r2(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_56,plain,
( r2(X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_57,axiom,
l0(a),
axiom_20 ).
cnf(c_0_58,plain,
~ l0(X1),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
$false,
inference(sr,[status(thm)],[c_0_57,c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN193-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n023.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 18:19:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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/tmp/tmp.ntQzJXBe9T/E---3.1_1367.p
% 0.59/0.59 # Version: 3.1pre001
% 0.59/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.59/0.59 # Starting sh5l with 300s (1) cores
% 0.59/0.59 # sh5l with pid 1450 completed with status 0
% 0.59/0.59 # Result found by sh5l
% 0.59/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.59/0.59 # Starting sh5l with 300s (1) cores
% 0.59/0.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.59/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.59/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.59/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.59/0.59 # SAT001_MinMin_p005000_rr_RG with pid 1458 completed with status 0
% 0.59/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.59/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.59/0.59 # Starting sh5l with 300s (1) cores
% 0.59/0.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.59/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.59/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.59/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.59/0.59 # Preprocessing time : 0.005 s
% 0.59/0.59 # Presaturation interreduction done
% 0.59/0.59
% 0.59/0.59 # Proof found!
% 0.59/0.59 # SZS status Unsatisfiable
% 0.59/0.59 # SZS output start CNFRefutation
% See solution above
% 0.59/0.59 # Parsed axioms : 369
% 0.59/0.59 # Removed by relevancy pruning/SinE : 0
% 0.59/0.59 # Initial clauses : 369
% 0.59/0.59 # Removed in clause preprocessing : 7
% 0.59/0.59 # Initial clauses in saturation : 362
% 0.59/0.59 # Processed clauses : 967
% 0.59/0.59 # ...of these trivial : 25
% 0.59/0.59 # ...subsumed : 30
% 0.59/0.59 # ...remaining for further processing : 912
% 0.59/0.59 # Other redundant clauses eliminated : 0
% 0.59/0.59 # Clauses deleted for lack of memory : 0
% 0.59/0.59 # Backward-subsumed : 52
% 0.59/0.59 # Backward-rewritten : 176
% 0.59/0.59 # Generated clauses : 1202
% 0.59/0.59 # ...of the previous two non-redundant : 827
% 0.59/0.59 # ...aggressively subsumed : 0
% 0.59/0.59 # Contextual simplify-reflections : 2
% 0.59/0.59 # Paramodulations : 1200
% 0.59/0.59 # Factorizations : 0
% 0.59/0.59 # NegExts : 0
% 0.59/0.59 # Equation resolutions : 0
% 0.59/0.59 # Total rewrite steps : 879
% 0.59/0.59 # Propositional unsat checks : 0
% 0.59/0.59 # Propositional check models : 0
% 0.59/0.59 # Propositional check unsatisfiable : 0
% 0.59/0.59 # Propositional clauses : 0
% 0.59/0.59 # Propositional clauses after purity: 0
% 0.59/0.59 # Propositional unsat core size : 0
% 0.59/0.59 # Propositional preprocessing time : 0.000
% 0.59/0.59 # Propositional encoding time : 0.000
% 0.59/0.59 # Propositional solver time : 0.000
% 0.59/0.59 # Success case prop preproc time : 0.000
% 0.59/0.59 # Success case prop encoding time : 0.000
% 0.59/0.59 # Success case prop solver time : 0.000
% 0.59/0.59 # Current number of processed clauses : 354
% 0.59/0.59 # Positive orientable unit clauses : 151
% 0.59/0.59 # Positive unorientable unit clauses: 0
% 0.59/0.59 # Negative unit clauses : 3
% 0.59/0.59 # Non-unit-clauses : 200
% 0.59/0.59 # Current number of unprocessed clauses: 509
% 0.59/0.59 # ...number of literals in the above : 1256
% 0.59/0.59 # Current number of archived formulas : 0
% 0.59/0.59 # Current number of archived clauses : 558
% 0.59/0.59 # Clause-clause subsumption calls (NU) : 49357
% 0.59/0.59 # Rec. Clause-clause subsumption calls : 34593
% 0.59/0.59 # Non-unit clause-clause subsumptions : 50
% 0.59/0.59 # Unit Clause-clause subsumption calls : 2137
% 0.59/0.59 # Rewrite failures with RHS unbound : 0
% 0.59/0.59 # BW rewrite match attempts : 310
% 0.59/0.59 # BW rewrite match successes : 114
% 0.59/0.59 # Condensation attempts : 0
% 0.59/0.59 # Condensation successes : 0
% 0.59/0.59 # Termbank termtop insertions : 22953
% 0.59/0.59
% 0.59/0.59 # -------------------------------------------------
% 0.59/0.59 # User time : 0.074 s
% 0.59/0.59 # System time : 0.007 s
% 0.59/0.59 # Total time : 0.081 s
% 0.59/0.59 # Maximum resident set size: 2528 pages
% 0.59/0.59
% 0.59/0.59 # -------------------------------------------------
% 0.59/0.59 # User time : 0.079 s
% 0.59/0.59 # System time : 0.009 s
% 0.59/0.59 # Total time : 0.089 s
% 0.59/0.59 # Maximum resident set size: 2000 pages
% 0.59/0.59 % E---3.1 exiting
% 0.59/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------