TSTP Solution File: SWV378+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV378+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 : 600s
% DateTime : Wed Jul 20 17:47:01 EDT 2022
% Result : Theorem 8.47s 2.44s
% Output : CNFRefutation 8.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 12 unt; 9 nHn; 16 RR)
% Number of literals : 50 ( 9 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 51 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_46,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-irck8qm7/input.p',i_0_46) ).
cnf(i_0_31,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-irck8qm7/input.p',i_0_31) ).
cnf(i_0_45,negated_conjecture,
ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-irck8qm7/input.p',i_0_45) ).
cnf(i_0_30,plain,
~ ok(triple(X1,X2,bad)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-irck8qm7/input.p',i_0_30) ).
cnf(i_0_35,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-irck8qm7/input.p',i_0_35) ).
cnf(i_0_33,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-irck8qm7/input.p',i_0_33) ).
cnf(i_0_48,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-irck8qm7/input.p',i_0_48) ).
cnf(i_0_51,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-irck8qm7/input.p',i_0_51) ).
cnf(i_0_34,plain,
( triple(remove_pqp(X1,X2),remove_slb(X3,X2),X4) = remove_cpq(triple(X1,X3,X4),X2)
| ~ contains_slb(X3,X2)
| ~ less_than(lookup_slb(X3,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-irck8qm7/input.p',i_0_34) ).
cnf(c_0_61,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
i_0_46 ).
cnf(c_0_62,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
i_0_31 ).
cnf(c_0_63,negated_conjecture,
ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
i_0_45 ).
cnf(c_0_64,negated_conjecture,
esk3_0 = bad,
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,plain,
~ ok(triple(X1,X2,bad)),
i_0_30 ).
cnf(c_0_66,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
| ~ contains_slb(X2,X4)
| ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
i_0_35 ).
cnf(c_0_67,negated_conjecture,
ok(remove_cpq(triple(esk1_0,esk2_0,bad),esk4_0)),
inference(rw,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,plain,
( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
| contains_slb(X2,X4) ),
i_0_33 ).
cnf(c_0_69,plain,
( ~ strictly_less_than(X1,lookup_slb(X2,X1))
| ~ contains_slb(X2,X1)
| ~ ok(remove_cpq(triple(X3,X2,X4),X1)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,plain,
contains_slb(esk2_0,esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_65]) ).
cnf(c_0_71,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
i_0_48 ).
cnf(c_0_72,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
i_0_51 ).
cnf(c_0_73,plain,
( triple(remove_pqp(X1,X2),remove_slb(X3,X2),X4) = remove_cpq(triple(X1,X3,X4),X2)
| ~ contains_slb(X3,X2)
| ~ less_than(lookup_slb(X3,X2),X2) ),
i_0_34 ).
cnf(c_0_74,negated_conjecture,
~ strictly_less_than(esk4_0,lookup_slb(esk2_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_67]),c_0_70])]) ).
cnf(c_0_75,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_76,plain,
( ~ contains_slb(X1,X2)
| ~ ok(remove_cpq(triple(X3,X1,bad),X2))
| ~ less_than(lookup_slb(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_65,c_0_73]) ).
cnf(c_0_77,plain,
less_than(lookup_slb(esk2_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_67]),c_0_70]),c_0_77])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV378+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n010.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 : 600
% 0.13/0.34 % DateTime : Wed Jun 15 18:24:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.47/2.44 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.47/2.44 # Version: 2.1pre011
% 8.47/2.44 # Preprocessing time : 0.019 s
% 8.47/2.44
% 8.47/2.44 # Proof found!
% 8.47/2.44 # SZS status Theorem
% 8.47/2.44 # SZS output start CNFRefutation
% See solution above
% 8.47/2.44 # Proof object total steps : 27
% 8.47/2.44 # Proof object clause steps : 18
% 8.47/2.44 # Proof object formula steps : 9
% 8.47/2.44 # Proof object conjectures : 8
% 8.47/2.44 # Proof object clause conjectures : 6
% 8.47/2.44 # Proof object formula conjectures : 2
% 8.47/2.44 # Proof object initial clauses used : 9
% 8.47/2.44 # Proof object initial formulas used : 9
% 8.47/2.44 # Proof object generating inferences : 7
% 8.47/2.44 # Proof object simplifying inferences : 8
% 8.47/2.44 # Training examples: 0 positive, 0 negative
% 8.47/2.44 # Parsed axioms : 50
% 8.47/2.44 # Removed by relevancy pruning/SinE : 0
% 8.47/2.44 # Initial clauses : 50
% 8.47/2.44 # Removed in clause preprocessing : 0
% 8.47/2.44 # Initial clauses in saturation : 50
% 8.47/2.44 # Processed clauses : 65
% 8.47/2.44 # ...of these trivial : 0
% 8.47/2.44 # ...subsumed : 3
% 8.47/2.44 # ...remaining for further processing : 62
% 8.47/2.44 # Other redundant clauses eliminated : 3
% 8.47/2.44 # Clauses deleted for lack of memory : 0
% 8.47/2.44 # Backward-subsumed : 0
% 8.47/2.44 # Backward-rewritten : 2
% 8.47/2.44 # Generated clauses : 123
% 8.47/2.44 # ...of the previous two non-trivial : 107
% 8.47/2.44 # Contextual simplify-reflections : 2
% 8.47/2.44 # Paramodulations : 119
% 8.47/2.44 # Factorizations : 2
% 8.47/2.44 # Equation resolutions : 3
% 8.47/2.44 # Propositional unsat checks : 0
% 8.47/2.44 # Propositional unsat check successes : 0
% 8.47/2.44 # Current number of processed clauses : 58
% 8.47/2.44 # Positive orientable unit clauses : 17
% 8.47/2.44 # Positive unorientable unit clauses: 0
% 8.47/2.44 # Negative unit clauses : 6
% 8.47/2.44 # Non-unit-clauses : 35
% 8.47/2.44 # Current number of unprocessed clauses: 87
% 8.47/2.44 # ...number of literals in the above : 290
% 8.47/2.44 # Current number of archived formulas : 0
% 8.47/2.44 # Current number of archived clauses : 2
% 8.47/2.44 # Clause-clause subsumption calls (NU) : 129
% 8.47/2.44 # Rec. Clause-clause subsumption calls : 86
% 8.47/2.44 # Non-unit clause-clause subsumptions : 4
% 8.47/2.44 # Unit Clause-clause subsumption calls : 25
% 8.47/2.44 # Rewrite failures with RHS unbound : 0
% 8.47/2.44 # BW rewrite match attempts : 7
% 8.47/2.44 # BW rewrite match successes : 1
% 8.47/2.44 # Condensation attempts : 0
% 8.47/2.44 # Condensation successes : 0
% 8.47/2.44 # Termbank termtop insertions : 2696
% 8.47/2.44
% 8.47/2.44 # -------------------------------------------------
% 8.47/2.44 # User time : 0.020 s
% 8.47/2.44 # System time : 0.004 s
% 8.47/2.44 # Total time : 0.024 s
% 8.47/2.44 # ...preprocessing : 0.019 s
% 8.47/2.44 # ...main loop : 0.005 s
% 8.47/2.44 # Maximum resident set size: 7128 pages
% 8.47/2.44
%------------------------------------------------------------------------------