TSTP Solution File: SYN273-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN273-1 : TPTP v8.1.2. Released v1.1.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 : Sat May 4 10:06:48 EDT 2024
% Result : Unsatisfiable 0.36s 0.60s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 41 ( 18 unt; 0 nHn; 37 RR)
% Number of literals : 77 ( 0 equ; 40 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 53 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',rule_021) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',axiom_28) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',rule_107) ).
cnf(rule_127,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',rule_127) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',axiom_24) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',rule_129) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',axiom_19) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',rule_001) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',axiom_30) ).
cnf(prove_this,negated_conjecture,
~ p4(e,c,e),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',prove_this) ).
cnf(rule_287,axiom,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',rule_287) ).
cnf(rule_194,axiom,
( k3(X1,X1,X2)
| ~ k2(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.dOsFODvXYP/E---3.1_29930.p',rule_194) ).
cnf(c_0_12,plain,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
inference(fof_simplification,[status(thm)],[rule_021]) ).
cnf(c_0_13,plain,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
c_0_12 ).
cnf(c_0_14,axiom,
k0(e),
axiom_28 ).
cnf(c_0_15,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
inference(fof_simplification,[status(thm)],[rule_107]) ).
cnf(c_0_16,plain,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_17,plain,
( m1(X1,e,X1)
| ~ l0(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
l0(c),
axiom_24 ).
cnf(c_0_19,plain,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_20,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
c_0_15 ).
cnf(c_0_21,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_22,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_23,plain,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
c_0_16 ).
cnf(c_0_24,plain,
m1(c,e,c),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
c_0_19 ).
cnf(c_0_26,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21])]) ).
cnf(c_0_27,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_22 ).
cnf(c_0_28,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_29,negated_conjecture,
~ p4(e,c,e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_30,plain,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_287]) ).
cnf(c_0_31,plain,
( k3(X1,X1,X2)
| ~ k2(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_194]) ).
cnf(c_0_32,plain,
( k2(c,e)
| ~ k2(X1,e)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
k1(e),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
~ p4(e,c,e),
c_0_29 ).
cnf(c_0_36,plain,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
c_0_30 ).
cnf(c_0_37,plain,
( k3(X1,X1,X2)
| ~ k2(X2,X1) ),
c_0_31 ).
cnf(c_0_38,plain,
k2(c,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_39,negated_conjecture,
~ k3(e,e,c),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SYN273-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n013.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 10:31:49 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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.dOsFODvXYP/E---3.1_29930.p
% 0.36/0.60 # Version: 3.1.0
% 0.36/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.60 # Starting sh5l with 300s (1) cores
% 0.36/0.60 # new_bool_3 with pid 30009 completed with status 0
% 0.36/0.60 # Result found by new_bool_3
% 0.36/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.60 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.36/0.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.36/0.60 # SAT001_MinMin_p005000_rr_RG with pid 30015 completed with status 0
% 0.36/0.60 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.36/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.60 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.36/0.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.36/0.60 # Preprocessing time : 0.005 s
% 0.36/0.60 # Presaturation interreduction done
% 0.36/0.60
% 0.36/0.60 # Proof found!
% 0.36/0.60 # SZS status Unsatisfiable
% 0.36/0.60 # SZS output start CNFRefutation
% See solution above
% 0.36/0.60 # Parsed axioms : 369
% 0.36/0.60 # Removed by relevancy pruning/SinE : 39
% 0.36/0.60 # Initial clauses : 330
% 0.36/0.60 # Removed in clause preprocessing : 6
% 0.36/0.60 # Initial clauses in saturation : 324
% 0.36/0.60 # Processed clauses : 806
% 0.36/0.60 # ...of these trivial : 25
% 0.36/0.60 # ...subsumed : 29
% 0.36/0.60 # ...remaining for further processing : 752
% 0.36/0.60 # Other redundant clauses eliminated : 0
% 0.36/0.60 # Clauses deleted for lack of memory : 0
% 0.36/0.60 # Backward-subsumed : 18
% 0.36/0.60 # Backward-rewritten : 52
% 0.36/0.60 # Generated clauses : 960
% 0.36/0.60 # ...of the previous two non-redundant : 645
% 0.36/0.60 # ...aggressively subsumed : 0
% 0.36/0.60 # Contextual simplify-reflections : 1
% 0.36/0.60 # Paramodulations : 960
% 0.36/0.60 # Factorizations : 0
% 0.36/0.60 # NegExts : 0
% 0.36/0.60 # Equation resolutions : 0
% 0.36/0.60 # Disequality decompositions : 0
% 0.36/0.60 # Total rewrite steps : 611
% 0.36/0.60 # ...of those cached : 474
% 0.36/0.60 # Propositional unsat checks : 0
% 0.36/0.60 # Propositional check models : 0
% 0.36/0.60 # Propositional check unsatisfiable : 0
% 0.36/0.60 # Propositional clauses : 0
% 0.36/0.60 # Propositional clauses after purity: 0
% 0.36/0.60 # Propositional unsat core size : 0
% 0.36/0.60 # Propositional preprocessing time : 0.000
% 0.36/0.60 # Propositional encoding time : 0.000
% 0.36/0.60 # Propositional solver time : 0.000
% 0.36/0.60 # Success case prop preproc time : 0.000
% 0.36/0.60 # Success case prop encoding time : 0.000
% 0.36/0.60 # Success case prop solver time : 0.000
% 0.36/0.60 # Current number of processed clauses : 392
% 0.36/0.60 # Positive orientable unit clauses : 144
% 0.36/0.60 # Positive unorientable unit clauses: 0
% 0.36/0.60 # Negative unit clauses : 4
% 0.36/0.60 # Non-unit-clauses : 244
% 0.36/0.60 # Current number of unprocessed clauses: 426
% 0.36/0.60 # ...number of literals in the above : 1036
% 0.36/0.60 # Current number of archived formulas : 0
% 0.36/0.60 # Current number of archived clauses : 360
% 0.36/0.60 # Clause-clause subsumption calls (NU) : 35149
% 0.36/0.60 # Rec. Clause-clause subsumption calls : 25147
% 0.36/0.60 # Non-unit clause-clause subsumptions : 37
% 0.36/0.60 # Unit Clause-clause subsumption calls : 225
% 0.36/0.60 # Rewrite failures with RHS unbound : 0
% 0.36/0.60 # BW rewrite match attempts : 78
% 0.36/0.60 # BW rewrite match successes : 47
% 0.36/0.60 # Condensation attempts : 0
% 0.36/0.60 # Condensation successes : 0
% 0.36/0.60 # Termbank termtop insertions : 22468
% 0.36/0.60 # Search garbage collected termcells : 1510
% 0.36/0.60
% 0.36/0.60 # -------------------------------------------------
% 0.36/0.60 # User time : 0.062 s
% 0.36/0.60 # System time : 0.008 s
% 0.36/0.60 # Total time : 0.070 s
% 0.36/0.60 # Maximum resident set size: 2624 pages
% 0.36/0.60
% 0.36/0.60 # -------------------------------------------------
% 0.36/0.60 # User time : 0.068 s
% 0.36/0.60 # System time : 0.009 s
% 0.36/0.60 # Total time : 0.078 s
% 0.36/0.60 # Maximum resident set size: 2016 pages
% 0.36/0.60 % E---3.1 exiting
% 0.36/0.60 % E exiting
%------------------------------------------------------------------------------