TSTP Solution File: SYN110-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN110-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:13:49 EDT 2023
% Result : Unsatisfiable 0.37s 0.61s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of clauses : 46 ( 27 unt; 0 nHn; 40 RR)
% Number of literals : 79 ( 0 equ; 36 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 42 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_024,axiom,
( m1(X1,a,X2)
| ~ m0(a,X3,a)
| ~ q0(X1,X2)
| ~ m1(X2,c,X2) ),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',rule_024) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',axiom_12) ).
cnf(rule_020,axiom,
( m1(c,c,c)
| ~ l0(c) ),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',rule_020) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',axiom_24) ).
cnf(rule_035,axiom,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',rule_035) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',axiom_20) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',axiom_9) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',axiom_19) ).
cnf(axiom_33,axiom,
q0(d,c),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',axiom_33) ).
cnf(rule_127,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',rule_127) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',rule_129) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',rule_001) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',axiom_37) ).
cnf(prove_this,negated_conjecture,
~ k2(c,a),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',prove_this) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox/tmp/tmp.aJyzhXnkUe/E---3.1_22836.p',axiom_15) ).
cnf(c_0_16,axiom,
( m1(X1,a,X2)
| ~ m0(a,X3,a)
| ~ q0(X1,X2)
| ~ m1(X2,c,X2) ),
rule_024 ).
cnf(c_0_17,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_18,axiom,
( m1(c,c,c)
| ~ l0(c) ),
rule_020 ).
cnf(c_0_19,axiom,
l0(c),
axiom_24 ).
cnf(c_0_20,axiom,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
rule_035 ).
cnf(c_0_21,axiom,
l0(a),
axiom_20 ).
cnf(c_0_22,plain,
( m1(X1,a,X2)
| ~ m1(X2,c,X2)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_23,plain,
m1(c,c,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_24,plain,
( m1(X1,a,X1)
| ~ r0(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
r0(b),
axiom_9 ).
cnf(c_0_26,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
rule_107 ).
cnf(c_0_27,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_28,plain,
( m1(X1,a,c)
| ~ q0(X1,c) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
q0(d,c),
axiom_33 ).
cnf(c_0_30,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
rule_127 ).
cnf(c_0_31,plain,
m1(b,a,b),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
rule_129 ).
cnf(c_0_33,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27])]) ).
cnf(c_0_34,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_35,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_36,plain,
m1(d,a,c),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
~ k2(c,a),
prove_this ).
cnf(c_0_38,plain,
( k2(b,a)
| ~ k2(X1,a)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
k1(a),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_42,plain,
( ~ k2(X1,a)
| ~ k1(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_36]),c_0_37]) ).
cnf(c_0_43,plain,
k2(b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_44,plain,
k1(b),
inference(spm,[status(thm)],[c_0_34,c_0_41]) ).
cnf(c_0_45,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN110-1 : TPTP v8.1.2. Released v1.1.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n005.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 18:02:46 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.37/0.53 Running first-order theorem proving
% 0.37/0.53 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.aJyzhXnkUe/E---3.1_22836.p
% 0.37/0.61 # Version: 3.1pre001
% 0.37/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.61 # Starting sh5l with 300s (1) cores
% 0.37/0.61 # new_bool_3 with pid 22915 completed with status 0
% 0.37/0.61 # Result found by new_bool_3
% 0.37/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.61 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.37/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.37/0.61 # SAT001_MinMin_p005000_rr_RG with pid 22921 completed with status 0
% 0.37/0.61 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.37/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.61 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.37/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.37/0.61 # Preprocessing time : 0.005 s
% 0.37/0.61 # Presaturation interreduction done
% 0.37/0.61
% 0.37/0.61 # Proof found!
% 0.37/0.61 # SZS status Unsatisfiable
% 0.37/0.61 # SZS output start CNFRefutation
% See solution above
% 0.37/0.61 # Parsed axioms : 369
% 0.37/0.61 # Removed by relevancy pruning/SinE : 41
% 0.37/0.61 # Initial clauses : 328
% 0.37/0.61 # Removed in clause preprocessing : 5
% 0.37/0.61 # Initial clauses in saturation : 323
% 0.37/0.61 # Processed clauses : 800
% 0.37/0.61 # ...of these trivial : 38
% 0.37/0.61 # ...subsumed : 24
% 0.37/0.61 # ...remaining for further processing : 738
% 0.37/0.61 # Other redundant clauses eliminated : 0
% 0.37/0.61 # Clauses deleted for lack of memory : 0
% 0.37/0.61 # Backward-subsumed : 19
% 0.37/0.61 # Backward-rewritten : 60
% 0.37/0.61 # Generated clauses : 903
% 0.37/0.61 # ...of the previous two non-redundant : 595
% 0.37/0.61 # ...aggressively subsumed : 0
% 0.37/0.61 # Contextual simplify-reflections : 1
% 0.37/0.61 # Paramodulations : 903
% 0.37/0.61 # Factorizations : 0
% 0.37/0.61 # NegExts : 0
% 0.37/0.61 # Equation resolutions : 0
% 0.37/0.61 # Total rewrite steps : 615
% 0.37/0.61 # Propositional unsat checks : 0
% 0.37/0.61 # Propositional check models : 0
% 0.37/0.61 # Propositional check unsatisfiable : 0
% 0.37/0.61 # Propositional clauses : 0
% 0.37/0.61 # Propositional clauses after purity: 0
% 0.37/0.61 # Propositional unsat core size : 0
% 0.37/0.61 # Propositional preprocessing time : 0.000
% 0.37/0.61 # Propositional encoding time : 0.000
% 0.37/0.61 # Propositional solver time : 0.000
% 0.37/0.61 # Success case prop preproc time : 0.000
% 0.37/0.61 # Success case prop encoding time : 0.000
% 0.37/0.61 # Success case prop solver time : 0.000
% 0.37/0.61 # Current number of processed clauses : 371
% 0.37/0.61 # Positive orientable unit clauses : 132
% 0.37/0.61 # Positive unorientable unit clauses: 0
% 0.37/0.61 # Negative unit clauses : 1
% 0.37/0.61 # Non-unit-clauses : 238
% 0.37/0.61 # Current number of unprocessed clauses: 394
% 0.37/0.61 # ...number of literals in the above : 1003
% 0.37/0.61 # Current number of archived formulas : 0
% 0.37/0.61 # Current number of archived clauses : 367
% 0.37/0.61 # Clause-clause subsumption calls (NU) : 33282
% 0.37/0.61 # Rec. Clause-clause subsumption calls : 23542
% 0.37/0.61 # Non-unit clause-clause subsumptions : 33
% 0.37/0.61 # Unit Clause-clause subsumption calls : 377
% 0.37/0.61 # Rewrite failures with RHS unbound : 0
% 0.37/0.61 # BW rewrite match attempts : 120
% 0.37/0.61 # BW rewrite match successes : 55
% 0.37/0.61 # Condensation attempts : 0
% 0.37/0.61 # Condensation successes : 0
% 0.37/0.61 # Termbank termtop insertions : 18884
% 0.37/0.61
% 0.37/0.61 # -------------------------------------------------
% 0.37/0.61 # User time : 0.055 s
% 0.37/0.61 # System time : 0.004 s
% 0.37/0.61 # Total time : 0.059 s
% 0.37/0.61 # Maximum resident set size: 2472 pages
% 0.37/0.61
% 0.37/0.61 # -------------------------------------------------
% 0.37/0.61 # User time : 0.060 s
% 0.37/0.61 # System time : 0.007 s
% 0.37/0.61 # Total time : 0.068 s
% 0.37/0.61 # Maximum resident set size: 2000 pages
% 0.37/0.61 % E---3.1 exiting
% 0.37/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------