TSTP Solution File: SYN190-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN190-1 : TPTP v8.1.2. Released v1.1.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:29:32 EDT 2023
% Result : Unsatisfiable 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of clauses : 69 ( 31 unt; 0 nHn; 45 RR)
% Number of literals : 136 ( 0 equ; 70 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 116 ( 45 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',axiom_14) ).
cnf(axiom_36,axiom,
q0(a,b),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',axiom_36) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_085) ).
cnf(rule_190,axiom,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_190) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',axiom_1) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_133) ).
cnf(rule_082,axiom,
( p1(X1,X2,X3)
| ~ m0(X3,X1,X4)
| ~ p1(X3,X1,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_082) ).
cnf(rule_005,axiom,
( m1(X1,X2,X1)
| ~ m0(X2,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_005) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',axiom_19) ).
cnf(rule_176,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_176) ).
cnf(rule_225,axiom,
( m3(X1,X2,X1)
| ~ m0(X3,X3,X2)
| ~ l2(X4,X1)
| ~ m0(X1,X4,X4)
| ~ s2(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_225) ).
cnf(rule_146,axiom,
( p2(X1,X2,X2)
| ~ p1(X1,X3,X4)
| ~ l1(X3,X4)
| ~ p2(X1,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_146) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_002) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',axiom_34) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',axiom_12) ).
cnf(rule_268,axiom,
( r3(X1,X1,X2)
| ~ m2(X2)
| ~ m3(X3,b,X1)
| ~ r3(X2,X4,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_268) ).
cnf(rule_267,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_267) ).
cnf(prove_this,negated_conjecture,
~ r3(a,X1,d),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',prove_this) ).
cnf(rule_135,axiom,
( m2(X1)
| ~ s0(X1)
| ~ l1(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.SmIvDrSA16/E---3.1_16225.p',rule_135) ).
cnf(c_0_22,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_23,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_24,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_25,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_26,axiom,
q0(a,b),
axiom_36 ).
cnf(c_0_27,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
s1(b),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_30,axiom,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
rule_190 ).
cnf(c_0_31,axiom,
s0(d),
axiom_1 ).
cnf(c_0_32,plain,
( s1(a)
| ~ s1(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_33,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_34,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,axiom,
( p1(X1,X2,X3)
| ~ m0(X3,X1,X4)
| ~ p1(X3,X1,X4) ),
rule_082 ).
cnf(c_0_36,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_37,axiom,
( m1(X1,X2,X1)
| ~ m0(X2,X2,X1) ),
rule_005 ).
cnf(c_0_38,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_39,plain,
( s2(d)
| ~ s1(a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_40,plain,
s1(a),
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_41,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_42,plain,
( p1(X1,X2,X1)
| ~ m0(X1,X1,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
rule_176 ).
cnf(c_0_44,plain,
m1(X1,d,X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,axiom,
( m3(X1,X2,X1)
| ~ m0(X3,X3,X2)
| ~ l2(X4,X1)
| ~ m0(X1,X4,X4)
| ~ s2(X3) ),
rule_225 ).
cnf(c_0_46,plain,
s2(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_47,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_48,axiom,
( p2(X1,X2,X2)
| ~ p1(X1,X3,X4)
| ~ l1(X3,X4)
| ~ p2(X1,X2,X1) ),
rule_146 ).
cnf(c_0_49,plain,
p1(d,X1,d),
inference(spm,[status(thm)],[c_0_42,c_0_38]) ).
cnf(c_0_50,plain,
p2(d,X1,d),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
rule_002 ).
cnf(c_0_52,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_53,plain,
( m3(X1,X2,X1)
| ~ l2(X3,X1)
| ~ m0(X1,X3,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_38]),c_0_46])]) ).
cnf(c_0_54,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_55,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_47,c_0_25]) ).
cnf(c_0_56,plain,
( p2(d,X1,X1)
| ~ l1(X2,d) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_57,plain,
l1(d,d),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,axiom,
( r3(X1,X1,X2)
| ~ m2(X2)
| ~ m3(X3,b,X1)
| ~ r3(X2,X4,X4) ),
rule_268 ).
cnf(c_0_59,plain,
m3(a,X1,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_60,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
rule_267 ).
cnf(c_0_61,plain,
p2(d,X1,X1),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
( r3(a,a,X1)
| ~ r3(X1,X2,X2)
| ~ m2(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
r3(d,X1,d),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
~ r3(a,X1,d),
prove_this ).
cnf(c_0_65,axiom,
( m2(X1)
| ~ s0(X1)
| ~ l1(X2,X3) ),
rule_135 ).
cnf(c_0_66,plain,
~ m2(d),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_67,plain,
( m2(X1)
| ~ s0(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_57]) ).
cnf(c_0_68,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SYN190-1 : TPTP v8.1.2. Released v1.1.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n009.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 2400
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon Oct 2 18:16:44 EDT 2023
% 0.14/0.33 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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/tmp/tmp.SmIvDrSA16/E---3.1_16225.p
% 0.20/0.58 # Version: 3.1pre001
% 0.20/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.58 # Starting sh5l with 300s (1) cores
% 0.20/0.58 # new_bool_1 with pid 16304 completed with status 0
% 0.20/0.58 # Result found by new_bool_1
% 0.20/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.58 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.58 # SAT001_MinMin_p005000_rr_RG with pid 16311 completed with status 0
% 0.20/0.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.58 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.58 # Preprocessing time : 0.004 s
% 0.20/0.58 # Presaturation interreduction done
% 0.20/0.58
% 0.20/0.58 # Proof found!
% 0.20/0.58 # SZS status Unsatisfiable
% 0.20/0.58 # SZS output start CNFRefutation
% See solution above
% 0.20/0.58 # Parsed axioms : 369
% 0.20/0.58 # Removed by relevancy pruning/SinE : 38
% 0.20/0.58 # Initial clauses : 331
% 0.20/0.58 # Removed in clause preprocessing : 5
% 0.20/0.58 # Initial clauses in saturation : 326
% 0.20/0.58 # Processed clauses : 1493
% 0.20/0.58 # ...of these trivial : 81
% 0.20/0.58 # ...subsumed : 157
% 0.20/0.58 # ...remaining for further processing : 1255
% 0.20/0.58 # Other redundant clauses eliminated : 0
% 0.20/0.58 # Clauses deleted for lack of memory : 0
% 0.20/0.58 # Backward-subsumed : 104
% 0.20/0.58 # Backward-rewritten : 289
% 0.20/0.58 # Generated clauses : 2242
% 0.20/0.58 # ...of the previous two non-redundant : 1511
% 0.20/0.58 # ...aggressively subsumed : 0
% 0.20/0.58 # Contextual simplify-reflections : 4
% 0.20/0.58 # Paramodulations : 2242
% 0.20/0.58 # Factorizations : 0
% 0.20/0.58 # NegExts : 0
% 0.20/0.58 # Equation resolutions : 0
% 0.20/0.58 # Total rewrite steps : 1624
% 0.20/0.58 # Propositional unsat checks : 0
% 0.20/0.58 # Propositional check models : 0
% 0.20/0.58 # Propositional check unsatisfiable : 0
% 0.20/0.58 # Propositional clauses : 0
% 0.20/0.58 # Propositional clauses after purity: 0
% 0.20/0.58 # Propositional unsat core size : 0
% 0.20/0.58 # Propositional preprocessing time : 0.000
% 0.20/0.58 # Propositional encoding time : 0.000
% 0.20/0.58 # Propositional solver time : 0.000
% 0.20/0.58 # Success case prop preproc time : 0.000
% 0.20/0.58 # Success case prop encoding time : 0.000
% 0.20/0.58 # Success case prop solver time : 0.000
% 0.20/0.58 # Current number of processed clauses : 570
% 0.20/0.58 # Positive orientable unit clauses : 226
% 0.20/0.58 # Positive unorientable unit clauses: 0
% 0.20/0.58 # Negative unit clauses : 3
% 0.20/0.58 # Non-unit-clauses : 341
% 0.20/0.58 # Current number of unprocessed clauses: 274
% 0.20/0.58 # ...number of literals in the above : 877
% 0.20/0.58 # Current number of archived formulas : 0
% 0.20/0.58 # Current number of archived clauses : 685
% 0.20/0.58 # Clause-clause subsumption calls (NU) : 53820
% 0.20/0.58 # Rec. Clause-clause subsumption calls : 41701
% 0.20/0.58 # Non-unit clause-clause subsumptions : 250
% 0.20/0.58 # Unit Clause-clause subsumption calls : 3273
% 0.20/0.58 # Rewrite failures with RHS unbound : 0
% 0.20/0.58 # BW rewrite match attempts : 669
% 0.20/0.58 # BW rewrite match successes : 203
% 0.20/0.58 # Condensation attempts : 0
% 0.20/0.58 # Condensation successes : 0
% 0.20/0.58 # Termbank termtop insertions : 33186
% 0.20/0.58
% 0.20/0.58 # -------------------------------------------------
% 0.20/0.58 # User time : 0.090 s
% 0.20/0.58 # System time : 0.002 s
% 0.20/0.58 # Total time : 0.092 s
% 0.20/0.58 # Maximum resident set size: 2480 pages
% 0.20/0.58
% 0.20/0.58 # -------------------------------------------------
% 0.20/0.58 # User time : 0.097 s
% 0.20/0.58 # System time : 0.004 s
% 0.20/0.58 # Total time : 0.100 s
% 0.20/0.58 # Maximum resident set size: 2000 pages
% 0.20/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------