TSTP Solution File: SEU056+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU056+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:14 EDT 2022
% Result : Theorem 7.89s 2.43s
% Output : CNFRefutation 7.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 15 unt; 0 nHn; 20 RR)
% Number of literals : 35 ( 12 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_42,plain,
( set_intersection2(relation_image(X1,X2),relation_image(X1,X3)) = relation_image(X1,set_intersection2(X2,X3))
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5u4mmsve/input.p',i_0_42) ).
cnf(i_0_44,negated_conjecture,
one_to_one(esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5u4mmsve/input.p',i_0_44) ).
cnf(i_0_47,negated_conjecture,
relation(esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5u4mmsve/input.p',i_0_47) ).
cnf(i_0_46,negated_conjecture,
function(esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5u4mmsve/input.p',i_0_46) ).
cnf(i_0_9,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5u4mmsve/input.p',i_0_9) ).
cnf(i_0_45,negated_conjecture,
disjoint(esk12_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5u4mmsve/input.p',i_0_45) ).
cnf(i_0_48,plain,
( relation_image(X1,empty_set) = empty_set
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5u4mmsve/input.p',i_0_48) ).
cnf(i_0_8,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5u4mmsve/input.p',i_0_8) ).
cnf(i_0_43,negated_conjecture,
~ disjoint(relation_image(esk14_0,esk12_0),relation_image(esk14_0,esk13_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5u4mmsve/input.p',i_0_43) ).
cnf(c_0_58,plain,
( set_intersection2(relation_image(X1,X2),relation_image(X1,X3)) = relation_image(X1,set_intersection2(X2,X3))
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1) ),
i_0_42 ).
cnf(c_0_59,negated_conjecture,
one_to_one(esk14_0),
i_0_44 ).
cnf(c_0_60,negated_conjecture,
relation(esk14_0),
i_0_47 ).
cnf(c_0_61,negated_conjecture,
function(esk14_0),
i_0_46 ).
cnf(c_0_62,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
i_0_9 ).
cnf(c_0_63,negated_conjecture,
disjoint(esk12_0,esk13_0),
i_0_45 ).
cnf(c_0_64,plain,
( relation_image(X1,empty_set) = empty_set
| ~ relation(X1) ),
i_0_48 ).
cnf(c_0_65,negated_conjecture,
relation_image(esk14_0,set_intersection2(X1,X2)) = set_intersection2(relation_image(esk14_0,X1),relation_image(esk14_0,X2)),
inference(cn,[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])]) ).
cnf(c_0_66,negated_conjecture,
set_intersection2(esk12_0,esk13_0) = empty_set,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
relation_image(esk14_0,empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_64,c_0_60]) ).
cnf(c_0_68,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
i_0_8 ).
cnf(c_0_69,negated_conjecture,
set_intersection2(relation_image(esk14_0,esk12_0),relation_image(esk14_0,esk13_0)) = empty_set,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_70,negated_conjecture,
~ disjoint(relation_image(esk14_0,esk12_0),relation_image(esk14_0,esk13_0)),
i_0_43 ).
cnf(c_0_71,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU056+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n009.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 19 20:19:54 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 7.89/2.43 # ENIGMATIC: Solved by autoschedule:
% 7.89/2.43 # No SInE strategy applied
% 7.89/2.43 # Trying AutoSched0 for 150 seconds
% 7.89/2.43 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 7.89/2.43 # and selection function SelectComplexG.
% 7.89/2.43 #
% 7.89/2.43 # Preprocessing time : 0.013 s
% 7.89/2.43
% 7.89/2.43 # Proof found!
% 7.89/2.43 # SZS status Theorem
% 7.89/2.43 # SZS output start CNFRefutation
% See solution above
% 7.89/2.43 # Training examples: 0 positive, 0 negative
% 7.89/2.43
% 7.89/2.43 # -------------------------------------------------
% 7.89/2.43 # User time : 0.019 s
% 7.89/2.43 # System time : 0.004 s
% 7.89/2.43 # Total time : 0.023 s
% 7.89/2.43 # Maximum resident set size: 7120 pages
% 7.89/2.43
%------------------------------------------------------------------------------