TSTP Solution File: SEU080+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU080+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 : Tue Jul 19 08:38:21 EDT 2022
% Result : Theorem 4.53s 2.28s
% Output : CNFRefutation 4.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 17 unt; 0 nHn; 21 RR)
% Number of literals : 37 ( 6 equ; 17 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_42,plain,
( subset(X1,X2)
| ~ function(X3)
| ~ relation(X3)
| ~ subset(X1,relation_rng(X3))
| ~ subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rdigk9yk/lgb.p',i_0_42) ).
cnf(i_0_44,negated_conjecture,
subset(esk13_0,relation_rng(esk14_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rdigk9yk/lgb.p',i_0_44) ).
cnf(i_0_48,negated_conjecture,
relation(esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rdigk9yk/lgb.p',i_0_48) ).
cnf(i_0_47,negated_conjecture,
function(esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rdigk9yk/lgb.p',i_0_47) ).
cnf(i_0_46,negated_conjecture,
relation_inverse_image(esk14_0,esk13_0) = relation_inverse_image(esk14_0,esk12_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rdigk9yk/lgb.p',i_0_46) ).
cnf(i_0_41,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rdigk9yk/lgb.p',i_0_41) ).
cnf(i_0_45,negated_conjecture,
subset(esk12_0,relation_rng(esk14_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rdigk9yk/lgb.p',i_0_45) ).
cnf(i_0_7,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rdigk9yk/lgb.p',i_0_7) ).
cnf(i_0_43,negated_conjecture,
esk13_0 != esk12_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rdigk9yk/lgb.p',i_0_43) ).
cnf(c_0_58,plain,
( subset(X1,X2)
| ~ function(X3)
| ~ relation(X3)
| ~ subset(X1,relation_rng(X3))
| ~ subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2)) ),
i_0_42 ).
cnf(c_0_59,negated_conjecture,
subset(esk13_0,relation_rng(esk14_0)),
i_0_44 ).
cnf(c_0_60,negated_conjecture,
relation(esk14_0),
i_0_48 ).
cnf(c_0_61,negated_conjecture,
function(esk14_0),
i_0_47 ).
cnf(c_0_62,negated_conjecture,
relation_inverse_image(esk14_0,esk13_0) = relation_inverse_image(esk14_0,esk12_0),
i_0_46 ).
cnf(c_0_63,negated_conjecture,
( subset(esk13_0,X1)
| ~ subset(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61]),c_0_62])]) ).
cnf(c_0_64,plain,
subset(X1,X1),
i_0_41 ).
cnf(c_0_65,negated_conjecture,
subset(esk12_0,relation_rng(esk14_0)),
i_0_45 ).
cnf(c_0_66,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_7 ).
cnf(c_0_67,plain,
subset(esk13_0,esk12_0),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
esk13_0 != esk12_0,
i_0_43 ).
cnf(c_0_69,negated_conjecture,
( subset(esk12_0,X1)
| ~ subset(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_65]),c_0_60]),c_0_61])]) ).
cnf(c_0_70,plain,
~ subset(esk12_0,esk13_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_62]),c_0_64])]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU080+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 : Mon Jun 20 01:43:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.53/2.28 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.53/2.28 # No SInE strategy applied
% 4.53/2.28 # Trying AutoSched0 for 150 seconds
% 4.53/2.28 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S079N
% 4.53/2.28 # and selection function SelectGrCQArEqFirst.
% 4.53/2.28 #
% 4.53/2.28 # Preprocessing time : 0.023 s
% 4.53/2.28 # Presaturation interreduction done
% 4.53/2.28
% 4.53/2.28 # Proof found!
% 4.53/2.28 # SZS status Theorem
% 4.53/2.28 # SZS output start CNFRefutation
% See solution above
% 4.53/2.28 # Training examples: 0 positive, 0 negative
% 4.53/2.28
% 4.53/2.28 # -------------------------------------------------
% 4.53/2.28 # User time : 0.026 s
% 4.53/2.28 # System time : 0.007 s
% 4.53/2.28 # Total time : 0.034 s
% 4.53/2.28 # Maximum resident set size: 7124 pages
% 4.53/2.28
%------------------------------------------------------------------------------