TSTP Solution File: SWV409+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV409+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:08 EDT 2022
% Result : Theorem 7.30s 2.26s
% Output : CNFRefutation 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 11 unt; 6 nHn; 27 RR)
% Number of literals : 67 ( 0 equ; 35 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_27,lemma,
( pair_in_list(X1,X2,esk5_2(X1,X2))
| ~ contains_slb(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ihyhudzj/lgb.p',i_0_27) ).
cnf(i_0_23,negated_conjecture,
contains_slb(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ihyhudzj/lgb.p',i_0_23) ).
cnf(i_0_24,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ strictly_less_than(X3,X2)
| ~ pair_in_list(X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ihyhudzj/lgb.p',i_0_24) ).
cnf(i_0_29,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ihyhudzj/lgb.p',i_0_29) ).
cnf(i_0_32,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ihyhudzj/lgb.p',i_0_32) ).
cnf(i_0_26,lemma,
( pair_in_list(update_slb(X1,X2),X3,esk4_4(X1,X3,X4,X2))
| ~ strictly_less_than(X3,X2)
| ~ less_than(X2,X4)
| ~ pair_in_list(X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ihyhudzj/lgb.p',i_0_26) ).
cnf(i_0_22,negated_conjecture,
strictly_less_than(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ihyhudzj/lgb.p',i_0_22) ).
cnf(i_0_21,negated_conjecture,
~ pair_in_list(update_slb(esk1_0,esk3_0),esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ihyhudzj/lgb.p',i_0_21) ).
cnf(i_0_25,lemma,
( less_than(X1,esk4_4(X2,X3,X4,X1))
| ~ strictly_less_than(X3,X1)
| ~ less_than(X1,X4)
| ~ pair_in_list(X2,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ihyhudzj/lgb.p',i_0_25) ).
cnf(i_0_20,negated_conjecture,
( ~ less_than(esk3_0,X1)
| ~ pair_in_list(update_slb(esk1_0,esk3_0),esk2_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ihyhudzj/lgb.p',i_0_20) ).
cnf(c_0_43,lemma,
( pair_in_list(X1,X2,esk5_2(X1,X2))
| ~ contains_slb(X1,X2) ),
i_0_27 ).
cnf(c_0_44,negated_conjecture,
contains_slb(esk1_0,esk2_0),
i_0_23 ).
cnf(c_0_45,lemma,
( pair_in_list(update_slb(X1,X2),X3,X2)
| ~ strictly_less_than(X4,X2)
| ~ strictly_less_than(X3,X2)
| ~ pair_in_list(X1,X3,X4) ),
i_0_24 ).
cnf(c_0_46,negated_conjecture,
pair_in_list(esk1_0,esk2_0,esk5_2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
i_0_29 ).
cnf(c_0_48,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
i_0_32 ).
cnf(c_0_49,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
| ~ strictly_less_than(esk5_2(esk1_0,esk2_0),X1)
| ~ strictly_less_than(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,lemma,
( pair_in_list(update_slb(X1,X2),X3,esk4_4(X1,X3,X4,X2))
| ~ strictly_less_than(X3,X2)
| ~ less_than(X2,X4)
| ~ pair_in_list(X1,X3,X4) ),
i_0_26 ).
cnf(c_0_52,plain,
( less_than(X1,esk5_2(esk1_0,esk2_0))
| pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
| ~ strictly_less_than(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
strictly_less_than(esk2_0,esk3_0),
i_0_22 ).
cnf(c_0_54,negated_conjecture,
~ pair_in_list(update_slb(esk1_0,esk3_0),esk2_0,esk3_0),
i_0_21 ).
cnf(c_0_55,lemma,
( less_than(X1,esk4_4(X2,X3,X4,X1))
| ~ strictly_less_than(X3,X1)
| ~ less_than(X1,X4)
| ~ pair_in_list(X2,X3,X4) ),
i_0_25 ).
cnf(c_0_56,negated_conjecture,
( pair_in_list(update_slb(esk1_0,X1),esk2_0,esk4_4(esk1_0,esk2_0,esk5_2(esk1_0,esk2_0),X1))
| ~ strictly_less_than(esk2_0,X1)
| ~ less_than(X1,esk5_2(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_51,c_0_46]) ).
cnf(c_0_57,negated_conjecture,
less_than(esk3_0,esk5_2(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( less_than(X1,esk4_4(esk1_0,esk2_0,esk5_2(esk1_0,esk2_0),X1))
| ~ strictly_less_than(esk2_0,X1)
| ~ less_than(X1,esk5_2(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_55,c_0_46]) ).
cnf(c_0_59,negated_conjecture,
( ~ less_than(esk3_0,X1)
| ~ pair_in_list(update_slb(esk1_0,esk3_0),esk2_0,X1) ),
i_0_20 ).
cnf(c_0_60,negated_conjecture,
pair_in_list(update_slb(esk1_0,esk3_0),esk2_0,esk4_4(esk1_0,esk2_0,esk5_2(esk1_0,esk2_0),esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_53])]) ).
cnf(c_0_61,negated_conjecture,
less_than(esk3_0,esk4_4(esk1_0,esk2_0,esk5_2(esk1_0,esk2_0),esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_57]),c_0_53])]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV409+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 : Tue Jun 14 17:18:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.30/2.26 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.30/2.26 # No SInE strategy applied
% 7.30/2.26 # Trying AutoSched0 for 150 seconds
% 7.30/2.26 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S011A
% 7.30/2.26 # and selection function PSelectDiffNegLit.
% 7.30/2.26 #
% 7.30/2.26 # Preprocessing time : 0.013 s
% 7.30/2.26 # Presaturation interreduction done
% 7.30/2.26
% 7.30/2.26 # Proof found!
% 7.30/2.26 # SZS status Theorem
% 7.30/2.26 # SZS output start CNFRefutation
% See solution above
% 7.30/2.26 # Training examples: 0 positive, 0 negative
% 7.30/2.26
% 7.30/2.26 # -------------------------------------------------
% 7.30/2.26 # User time : 0.015 s
% 7.30/2.26 # System time : 0.007 s
% 7.30/2.26 # Total time : 0.021 s
% 7.30/2.26 # Maximum resident set size: 7132 pages
% 7.30/2.26
%------------------------------------------------------------------------------