TSTP Solution File: SWV373+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:00 EDT 2022
% Result : Theorem 7.81s 2.38s
% Output : CNFRefutation 7.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 8 unt; 2 nHn; 12 RR)
% Number of literals : 24 ( 7 equ; 13 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 26 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_46,negated_conjecture,
~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b3n8h42g/input.p',i_0_46) ).
cnf(i_0_28,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b3n8h42g/input.p',i_0_28) ).
cnf(i_0_49,lemma,
( X1 != create_slb
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b3n8h42g/input.p',i_0_49) ).
cnf(i_0_45,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b3n8h42g/input.p',i_0_45) ).
cnf(i_0_41,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b3n8h42g/input.p',i_0_41) ).
cnf(i_0_48,lemma,
( contains_slb(X1,findmin_pqp_res(X2))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b3n8h42g/input.p',i_0_48) ).
cnf(c_0_56,negated_conjecture,
~ contains_cpq(triple(esk1_0,esk2_0,esk3_0),findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
i_0_46 ).
cnf(c_0_57,plain,
( contains_cpq(triple(X1,X2,X3),X4)
| ~ contains_slb(X2,X4) ),
i_0_28 ).
cnf(c_0_58,lemma,
( X1 != create_slb
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
i_0_49 ).
cnf(c_0_59,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
i_0_45 ).
cnf(c_0_60,negated_conjecture,
~ contains_slb(esk2_0,findmin_cpq_res(triple(esk1_0,esk2_0,esk3_0))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
( X1 = create_slb
| findmin_cpq_res(triple(X2,X1,X3)) = findmin_pqp_res(X2) ),
i_0_41 ).
cnf(c_0_62,negated_conjecture,
esk2_0 != create_slb,
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,lemma,
( contains_slb(X1,findmin_pqp_res(X2))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
i_0_48 ).
cnf(c_0_64,plain,
~ contains_slb(esk2_0,findmin_pqp_res(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_59]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 15 10:44:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.81/2.38 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.81/2.38 # Version: 2.1pre011
% 7.81/2.38 # Preprocessing time : 0.011 s
% 7.81/2.38
% 7.81/2.38 # Proof found!
% 7.81/2.38 # SZS status Theorem
% 7.81/2.38 # SZS output start CNFRefutation
% See solution above
% 7.81/2.38 # Proof object total steps : 16
% 7.81/2.38 # Proof object clause steps : 10
% 7.81/2.38 # Proof object formula steps : 6
% 7.81/2.38 # Proof object conjectures : 7
% 7.81/2.38 # Proof object clause conjectures : 5
% 7.81/2.38 # Proof object formula conjectures : 2
% 7.81/2.38 # Proof object initial clauses used : 6
% 7.81/2.38 # Proof object initial formulas used : 6
% 7.81/2.38 # Proof object generating inferences : 4
% 7.81/2.38 # Proof object simplifying inferences : 2
% 7.81/2.38 # Training examples: 0 positive, 0 negative
% 7.81/2.38 # Parsed axioms : 53
% 7.81/2.38 # Removed by relevancy pruning/SinE : 0
% 7.81/2.38 # Initial clauses : 53
% 7.81/2.38 # Removed in clause preprocessing : 0
% 7.81/2.38 # Initial clauses in saturation : 53
% 7.81/2.38 # Processed clauses : 62
% 7.81/2.38 # ...of these trivial : 0
% 7.81/2.38 # ...subsumed : 4
% 7.81/2.38 # ...remaining for further processing : 57
% 7.81/2.38 # Other redundant clauses eliminated : 3
% 7.81/2.38 # Clauses deleted for lack of memory : 0
% 7.81/2.38 # Backward-subsumed : 0
% 7.81/2.38 # Backward-rewritten : 0
% 7.81/2.38 # Generated clauses : 118
% 7.81/2.38 # ...of the previous two non-trivial : 103
% 7.81/2.38 # Contextual simplify-reflections : 3
% 7.81/2.38 # Paramodulations : 114
% 7.81/2.38 # Factorizations : 2
% 7.81/2.38 # Equation resolutions : 3
% 7.81/2.38 # Propositional unsat checks : 0
% 7.81/2.38 # Propositional unsat check successes : 0
% 7.81/2.38 # Current number of processed clauses : 55
% 7.81/2.38 # Positive orientable unit clauses : 12
% 7.81/2.38 # Positive unorientable unit clauses: 0
% 7.81/2.38 # Negative unit clauses : 8
% 7.81/2.38 # Non-unit-clauses : 35
% 7.81/2.38 # Current number of unprocessed clauses: 94
% 7.81/2.38 # ...number of literals in the above : 307
% 7.81/2.38 # Current number of archived formulas : 0
% 7.81/2.38 # Current number of archived clauses : 0
% 7.81/2.38 # Clause-clause subsumption calls (NU) : 180
% 7.81/2.38 # Rec. Clause-clause subsumption calls : 139
% 7.81/2.38 # Non-unit clause-clause subsumptions : 6
% 7.81/2.38 # Unit Clause-clause subsumption calls : 14
% 7.81/2.38 # Rewrite failures with RHS unbound : 0
% 7.81/2.38 # BW rewrite match attempts : 1
% 7.81/2.38 # BW rewrite match successes : 0
% 7.81/2.38 # Condensation attempts : 0
% 7.81/2.38 # Condensation successes : 0
% 7.81/2.38 # Termbank termtop insertions : 2663
% 7.81/2.38
% 7.81/2.38 # -------------------------------------------------
% 7.81/2.38 # User time : 0.010 s
% 7.81/2.38 # System time : 0.003 s
% 7.81/2.38 # Total time : 0.013 s
% 7.81/2.38 # ...preprocessing : 0.011 s
% 7.81/2.38 # ...main loop : 0.002 s
% 7.81/2.38 # Maximum resident set size: 7128 pages
% 7.81/2.38
%------------------------------------------------------------------------------