TSTP Solution File: SEU037+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU037+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:08 EDT 2022
% Result : Theorem 8.25s 2.48s
% Output : CNFRefutation 8.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 59 ( 15 equ; 37 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_57,plain,
( relation_dom(X1) = set_intersection2(relation_dom(X2),X3)
| X1 != relation_dom_restriction(X2,X3)
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if0gtodv/lgb.p',i_0_57) ).
cnf(i_0_18,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if0gtodv/lgb.p',i_0_18) ).
cnf(i_0_8,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if0gtodv/lgb.p',i_0_8) ).
cnf(i_0_60,negated_conjecture,
in(esk14_0,set_intersection2(relation_dom(esk15_0),esk13_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if0gtodv/lgb.p',i_0_60) ).
cnf(i_0_7,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if0gtodv/lgb.p',i_0_7) ).
cnf(i_0_56,plain,
( apply(X1,X2) = apply(X3,X2)
| X1 != relation_dom_restriction(X3,X4)
| ~ function(X3)
| ~ function(X1)
| ~ relation(X3)
| ~ relation(X1)
| ~ in(X2,relation_dom(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if0gtodv/lgb.p',i_0_56) ).
cnf(i_0_62,negated_conjecture,
relation(esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if0gtodv/lgb.p',i_0_62) ).
cnf(i_0_61,negated_conjecture,
function(esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if0gtodv/lgb.p',i_0_61) ).
cnf(i_0_59,negated_conjecture,
apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0) != apply(esk15_0,esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-if0gtodv/lgb.p',i_0_59) ).
cnf(c_0_72,plain,
( relation_dom(X1) = set_intersection2(relation_dom(X2),X3)
| X1 != relation_dom_restriction(X2,X3)
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1) ),
i_0_57 ).
cnf(c_0_73,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
i_0_18 ).
cnf(c_0_74,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
i_0_8 ).
cnf(c_0_75,negated_conjecture,
in(esk14_0,set_intersection2(relation_dom(esk15_0),esk13_0)),
i_0_60 ).
cnf(c_0_76,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_7 ).
cnf(c_0_77,plain,
( set_intersection2(relation_dom(X1),X2) = relation_dom(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_72]),c_0_73]),c_0_74]) ).
cnf(c_0_78,plain,
( apply(X1,X2) = apply(X3,X2)
| X1 != relation_dom_restriction(X3,X4)
| ~ function(X3)
| ~ function(X1)
| ~ relation(X3)
| ~ relation(X1)
| ~ in(X2,relation_dom(X1)) ),
i_0_56 ).
cnf(c_0_79,negated_conjecture,
in(esk14_0,set_intersection2(esk13_0,relation_dom(esk15_0))),
inference(rw,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_80,plain,
( set_intersection2(X1,relation_dom(X2)) = relation_dom(relation_dom_restriction(X2,X1))
| ~ relation(X2)
| ~ function(X2) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,negated_conjecture,
relation(esk15_0),
i_0_62 ).
cnf(c_0_82,negated_conjecture,
function(esk15_0),
i_0_61 ).
cnf(c_0_83,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X3,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_78]),c_0_73]),c_0_74]) ).
cnf(c_0_84,negated_conjecture,
in(esk14_0,relation_dom(relation_dom_restriction(esk15_0,esk13_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82])]) ).
cnf(c_0_85,negated_conjecture,
apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0) != apply(esk15_0,esk14_0),
i_0_59 ).
cnf(c_0_86,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_81]),c_0_82])]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU037+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 23:34:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.25/2.48 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.25/2.48 # No SInE strategy applied
% 8.25/2.48 # Trying AutoSched0 for 150 seconds
% 8.25/2.48 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S030A
% 8.25/2.48 # and selection function SelectStrongRRNonRROptimalLit.
% 8.25/2.48 #
% 8.25/2.48 # Preprocessing time : 0.012 s
% 8.25/2.48 # Presaturation interreduction done
% 8.25/2.48
% 8.25/2.48 # Proof found!
% 8.25/2.48 # SZS status Theorem
% 8.25/2.48 # SZS output start CNFRefutation
% See solution above
% 8.25/2.48 # Training examples: 0 positive, 0 negative
% 8.25/2.48
% 8.25/2.48 # -------------------------------------------------
% 8.25/2.48 # User time : 0.015 s
% 8.25/2.48 # System time : 0.007 s
% 8.25/2.48 # Total time : 0.022 s
% 8.25/2.48 # Maximum resident set size: 7124 pages
% 8.25/2.48
%------------------------------------------------------------------------------