TSTP Solution File: SEU039+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU039+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 7.50s 2.36s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 15 unt; 0 nHn; 24 RR)
% Number of literals : 80 ( 15 equ; 53 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
( in(X1,X2)
| X2 != relation_rng(X3)
| X1 != apply(X3,X4)
| ~ function(X3)
| ~ relation(X3)
| ~ in(X4,relation_dom(X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_17) ).
cnf(i_0_74,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_74) ).
cnf(i_0_30,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_30) ).
cnf(i_0_20,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_20) ).
cnf(i_0_75,negated_conjecture,
~ in(apply(esk19_0,esk18_0),relation_rng(relation_dom_restriction(esk19_0,esk17_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_75) ).
cnf(i_0_76,negated_conjecture,
in(esk18_0,esk17_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_76) ).
cnf(i_0_79,negated_conjecture,
relation(esk19_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_79) ).
cnf(i_0_78,negated_conjecture,
function(esk19_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_78) ).
cnf(i_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) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_72) ).
cnf(i_0_7,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_7) ).
cnf(i_0_11,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_11) ).
cnf(i_0_77,negated_conjecture,
in(esk18_0,relation_dom(esk19_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c4citm4u/input.p',i_0_77) ).
cnf(c_0_92,plain,
( in(X1,X2)
| X2 != relation_rng(X3)
| X1 != apply(X3,X4)
| ~ function(X3)
| ~ relation(X3)
| ~ in(X4,relation_dom(X3)) ),
i_0_17 ).
cnf(c_0_93,plain,
( in(apply(X1,X2),relation_rng(X1))
| ~ in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_92])]) ).
cnf(c_0_94,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
i_0_74 ).
cnf(c_0_95,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
i_0_30 ).
cnf(c_0_96,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
i_0_20 ).
cnf(c_0_97,negated_conjecture,
~ in(apply(esk19_0,esk18_0),relation_rng(relation_dom_restriction(esk19_0,esk17_0))),
i_0_75 ).
cnf(c_0_98,plain,
( in(apply(X1,X2),relation_rng(relation_dom_restriction(X1,X3)))
| ~ in(X2,relation_dom(relation_dom_restriction(X1,X3)))
| ~ in(X2,X3)
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]),c_0_96]) ).
cnf(c_0_99,negated_conjecture,
in(esk18_0,esk17_0),
i_0_76 ).
cnf(c_0_100,negated_conjecture,
relation(esk19_0),
i_0_79 ).
cnf(c_0_101,negated_conjecture,
function(esk19_0),
i_0_78 ).
cnf(c_0_102,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_72 ).
cnf(c_0_103,negated_conjecture,
~ in(esk18_0,relation_dom(relation_dom_restriction(esk19_0,esk17_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99]),c_0_100]),c_0_101])]) ).
cnf(c_0_104,plain,
( relation_dom(relation_dom_restriction(X1,X2)) = set_intersection2(relation_dom(X1),X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_102]),c_0_95]),c_0_96]) ).
cnf(c_0_105,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_7 ).
cnf(c_0_106,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_11 ).
cnf(c_0_107,plain,
~ in(esk18_0,set_intersection2(esk17_0,relation_dom(esk19_0))),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_100]),c_0_101])]),c_0_105]) ).
cnf(c_0_108,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_106]) ).
cnf(c_0_109,negated_conjecture,
in(esk18_0,relation_dom(esk19_0)),
i_0_77 ).
cnf(c_0_110,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_99])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU039+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 20 13:10:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.50/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.50/2.36 # No SInE strategy applied
% 7.50/2.36 # Trying AutoSched0 for 150 seconds
% 7.50/2.36 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 7.50/2.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.50/2.36 #
% 7.50/2.36 # Preprocessing time : 0.024 s
% 7.50/2.36 # Presaturation interreduction done
% 7.50/2.36
% 7.50/2.36 # Proof found!
% 7.50/2.36 # SZS status Theorem
% 7.50/2.36 # SZS output start CNFRefutation
% See solution above
% 7.50/2.36 # Training examples: 0 positive, 0 negative
% 7.50/2.36
% 7.50/2.36 # -------------------------------------------------
% 7.50/2.36 # User time : 0.043 s
% 7.50/2.36 # System time : 0.006 s
% 7.50/2.36 # Total time : 0.050 s
% 7.50/2.36 # Maximum resident set size: 7124 pages
% 7.50/2.36
%------------------------------------------------------------------------------