TSTP Solution File: SWV379+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV379+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 7.70s 2.49s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 12 unt; 19 nHn; 16 RR)
% Number of literals : 65 ( 26 equ; 16 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 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 : 52 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_48,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23sgk3dn/input.p',i_0_48) ).
cnf(i_0_51,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23sgk3dn/input.p',i_0_51) ).
cnf(i_0_38,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23sgk3dn/input.p',i_0_38) ).
cnf(i_0_37,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| contains_slb(X1,findmin_pqp_res(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23sgk3dn/input.p',i_0_37) ).
cnf(i_0_46,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23sgk3dn/input.p',i_0_46) ).
cnf(i_0_31,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23sgk3dn/input.p',i_0_31) ).
cnf(i_0_30,plain,
~ ok(triple(X1,X2,bad)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23sgk3dn/input.p',i_0_30) ).
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-23sgk3dn/input.p',i_0_45) ).
cnf(i_0_39,plain,
( X1 = create_slb
| triple(X2,update_slb(X1,findmin_pqp_res(X2)),X3) = findmin_cpq_eff(triple(X2,X1,X3))
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23sgk3dn/input.p',i_0_39) ).
cnf(i_0_36,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23sgk3dn/input.p',i_0_36) ).
cnf(c_0_62,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
i_0_48 ).
cnf(c_0_63,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
i_0_51 ).
cnf(c_0_64,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2))) ),
i_0_38 ).
cnf(c_0_65,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| contains_slb(X1,findmin_pqp_res(X2)) ),
i_0_37 ).
cnf(c_0_67,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
i_0_46 ).
cnf(c_0_68,plain,
( X1 = bad
| ok(triple(X2,X3,X1)) ),
i_0_31 ).
cnf(c_0_69,plain,
~ ok(triple(X1,X2,bad)),
i_0_30 ).
cnf(c_0_70,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_71,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
i_0_45 ).
cnf(c_0_72,negated_conjecture,
esk3_0 = bad,
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_73,plain,
( X1 = create_slb
| less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad))),
inference(rw,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,plain,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(spm,[status(thm)],[c_0_69,c_0_66]) ).
cnf(c_0_76,plain,
( X1 = create_slb
| triple(X2,update_slb(X1,findmin_pqp_res(X2)),X3) = findmin_cpq_eff(triple(X2,X1,X3))
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2)) ),
i_0_39 ).
cnf(c_0_77,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_75,c_0_74]) ).
cnf(c_0_79,plain,
( triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1))
| esk2_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]) ).
cnf(c_0_80,plain,
esk2_0 = create_slb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_79]),c_0_74])]) ).
cnf(c_0_81,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
i_0_36 ).
cnf(c_0_82,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_80]),c_0_81]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV379+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 03:36:15 EDT 2022
% 0.12/0.34 % 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.70/2.49 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.70/2.49 # Version: 2.1pre011
% 7.70/2.49 # Preprocessing time : 0.013 s
% 7.70/2.49
% 7.70/2.49 # Proof found!
% 7.70/2.49 # SZS status Theorem
% 7.70/2.49 # SZS output start CNFRefutation
% See solution above
% 7.70/2.49 # Proof object total steps : 31
% 7.70/2.49 # Proof object clause steps : 21
% 7.70/2.49 # Proof object formula steps : 10
% 7.70/2.49 # Proof object conjectures : 9
% 7.70/2.49 # Proof object clause conjectures : 7
% 7.70/2.49 # Proof object formula conjectures : 2
% 7.70/2.49 # Proof object initial clauses used : 10
% 7.70/2.49 # Proof object initial formulas used : 10
% 7.70/2.49 # Proof object generating inferences : 8
% 7.70/2.49 # Proof object simplifying inferences : 9
% 7.70/2.49 # Training examples: 0 positive, 0 negative
% 7.70/2.49 # Parsed axioms : 50
% 7.70/2.49 # Removed by relevancy pruning/SinE : 0
% 7.70/2.49 # Initial clauses : 50
% 7.70/2.49 # Removed in clause preprocessing : 0
% 7.70/2.49 # Initial clauses in saturation : 50
% 7.70/2.49 # Processed clauses : 147
% 7.70/2.49 # ...of these trivial : 1
% 7.70/2.49 # ...subsumed : 20
% 7.70/2.49 # ...remaining for further processing : 126
% 7.70/2.49 # Other redundant clauses eliminated : 3
% 7.70/2.49 # Clauses deleted for lack of memory : 0
% 7.70/2.49 # Backward-subsumed : 0
% 7.70/2.49 # Backward-rewritten : 9
% 7.70/2.49 # Generated clauses : 762
% 7.70/2.49 # ...of the previous two non-trivial : 680
% 7.70/2.49 # Contextual simplify-reflections : 10
% 7.70/2.49 # Paramodulations : 740
% 7.70/2.49 # Factorizations : 20
% 7.70/2.49 # Equation resolutions : 3
% 7.70/2.49 # Propositional unsat checks : 0
% 7.70/2.49 # Propositional unsat check successes : 0
% 7.70/2.49 # Current number of processed clauses : 115
% 7.70/2.49 # Positive orientable unit clauses : 17
% 7.70/2.49 # Positive unorientable unit clauses: 0
% 7.70/2.49 # Negative unit clauses : 12
% 7.70/2.49 # Non-unit-clauses : 86
% 7.70/2.49 # Current number of unprocessed clauses: 503
% 7.70/2.49 # ...number of literals in the above : 2376
% 7.70/2.49 # Current number of archived formulas : 0
% 7.70/2.49 # Current number of archived clauses : 9
% 7.70/2.49 # Clause-clause subsumption calls (NU) : 1375
% 7.70/2.49 # Rec. Clause-clause subsumption calls : 675
% 7.70/2.49 # Non-unit clause-clause subsumptions : 25
% 7.70/2.49 # Unit Clause-clause subsumption calls : 48
% 7.70/2.49 # Rewrite failures with RHS unbound : 0
% 7.70/2.49 # BW rewrite match attempts : 8
% 7.70/2.49 # BW rewrite match successes : 2
% 7.70/2.49 # Condensation attempts : 0
% 7.70/2.49 # Condensation successes : 0
% 7.70/2.49 # Termbank termtop insertions : 16080
% 7.70/2.49
% 7.70/2.49 # -------------------------------------------------
% 7.70/2.49 # User time : 0.023 s
% 7.70/2.49 # System time : 0.006 s
% 7.70/2.49 # Total time : 0.029 s
% 7.70/2.49 # ...preprocessing : 0.013 s
% 7.70/2.49 # ...main loop : 0.015 s
% 7.70/2.49 # Maximum resident set size: 7128 pages
% 7.70/2.49
%------------------------------------------------------------------------------