TSTP Solution File: SWW101+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW101+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 : Thu Jul 21 00:01:32 EDT 2022
% Result : Theorem 7.29s 2.34s
% Output : CNFRefutation 7.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 44 ( 27 unt; 6 nHn; 39 RR)
% Number of literals : 65 ( 38 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( bool(X1)
| X1 != false ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_8) ).
cnf(i_0_98,plain,
( prop(X1) = true
| ~ bool(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_98) ).
cnf(i_0_40,plain,
~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk4_0),esk4_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_40) ).
cnf(i_0_96,plain,
( prop(X1) = false
| bool(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_96) ).
cnf(i_0_87,plain,
lazy_impl(false,X1) = true,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_87) ).
cnf(i_0_67,plain,
( lazy_impl(true,X1) = X1
| ~ d(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_67) ).
cnf(i_0_77,plain,
d(false),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_77) ).
cnf(i_0_42,plain,
( forallprefers(X1,X2)
| X2 != true
| X1 != false ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_42) ).
cnf(i_0_99,plain,
( bool(X1)
| prop(X1) != true ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_99) ).
cnf(i_0_41,plain,
lazy_impl(true,lazy_impl(prop(esk4_0),esk4_0)) = false2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_41) ).
cnf(i_0_9,plain,
( X1 = false
| X1 = true
| ~ bool(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_9) ).
cnf(i_0_75,negated_conjecture,
false1 != false2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_75) ).
cnf(i_0_39,plain,
false1 = false,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_39) ).
cnf(i_0_78,plain,
d(true),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ptaabcpk/lgb.p',i_0_78) ).
cnf(c_0_114,plain,
( bool(X1)
| X1 != false ),
i_0_8 ).
cnf(c_0_115,plain,
( prop(X1) = true
| ~ bool(X1) ),
i_0_98 ).
cnf(c_0_116,plain,
bool(false),
inference(er,[status(thm)],[c_0_114]) ).
cnf(c_0_117,plain,
~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk4_0),esk4_0)),
i_0_40 ).
cnf(c_0_118,plain,
prop(false) = true,
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_119,plain,
( prop(X1) = false
| bool(X1) ),
i_0_96 ).
cnf(c_0_120,plain,
~ forallprefers(lazy_impl(true,false),lazy_impl(prop(esk4_0),esk4_0)),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_121,plain,
( prop(X1) = false
| prop(X1) = true ),
inference(spm,[status(thm)],[c_0_115,c_0_119]) ).
cnf(c_0_122,plain,
lazy_impl(false,X1) = true,
i_0_87 ).
cnf(c_0_123,plain,
( lazy_impl(true,X1) = X1
| ~ d(X1) ),
i_0_67 ).
cnf(c_0_124,plain,
d(false),
i_0_77 ).
cnf(c_0_125,plain,
( forallprefers(X1,X2)
| X2 != true
| X1 != false ),
i_0_42 ).
cnf(c_0_126,plain,
( prop(esk4_0) = true
| ~ forallprefers(lazy_impl(true,false),true) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_122]) ).
cnf(c_0_127,plain,
lazy_impl(true,false) = false,
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_128,plain,
forallprefers(false,true),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_125])]) ).
cnf(c_0_129,plain,
( bool(X1)
| prop(X1) != true ),
i_0_99 ).
cnf(c_0_130,plain,
prop(esk4_0) = true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_127]),c_0_128])]) ).
cnf(c_0_131,plain,
lazy_impl(true,lazy_impl(prop(esk4_0),esk4_0)) = false2,
i_0_41 ).
cnf(c_0_132,plain,
( X1 = false
| X1 = true
| ~ bool(X1) ),
i_0_9 ).
cnf(c_0_133,plain,
bool(esk4_0),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_134,negated_conjecture,
false1 != false2,
i_0_75 ).
cnf(c_0_135,plain,
false1 = false,
i_0_39 ).
cnf(c_0_136,plain,
lazy_impl(true,lazy_impl(true,esk4_0)) = false2,
inference(rw,[status(thm)],[c_0_131,c_0_130]) ).
cnf(c_0_137,plain,
( esk4_0 = true
| esk4_0 = false ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_138,negated_conjecture,
false2 != false,
inference(rw,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_139,plain,
d(true),
i_0_78 ).
cnf(c_0_140,plain,
~ forallprefers(false,lazy_impl(true,esk4_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_127]),c_0_130]) ).
cnf(c_0_141,plain,
esk4_0 = true,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_127]),c_0_127]),c_0_138]) ).
cnf(c_0_142,plain,
lazy_impl(true,true) = true,
inference(spm,[status(thm)],[c_0_123,c_0_139]) ).
cnf(c_0_143,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_140,c_0_141]),c_0_142]),c_0_128])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW101+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 5 03:12:50 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/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
% 7.29/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.29/2.34 # No SInE strategy applied
% 7.29/2.34 # Trying AutoSched0 for 150 seconds
% 7.29/2.34 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 7.29/2.34 # and selection function SelectNewComplexAHP.
% 7.29/2.34 #
% 7.29/2.34 # Preprocessing time : 0.023 s
% 7.29/2.34 # Presaturation interreduction done
% 7.29/2.34
% 7.29/2.34 # Proof found!
% 7.29/2.34 # SZS status Theorem
% 7.29/2.34 # SZS output start CNFRefutation
% See solution above
% 7.29/2.34 # Training examples: 0 positive, 0 negative
% 7.29/2.34
% 7.29/2.34 # -------------------------------------------------
% 7.29/2.34 # User time : 0.031 s
% 7.29/2.34 # System time : 0.005 s
% 7.29/2.34 # Total time : 0.036 s
% 7.29/2.34 # Maximum resident set size: 7128 pages
% 7.29/2.34
%------------------------------------------------------------------------------