TSTP Solution File: SEU263+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU263+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:40:12 EDT 2022
% Result : Theorem 7.66s 2.31s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 41 ( 11 unt; 0 nHn; 39 RR)
% Number of literals : 80 ( 0 equ; 41 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 85 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_3) ).
cnf(i_0_15,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_15) ).
cnf(i_0_23,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_23) ).
cnf(i_0_17,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ subset(X2,X4)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_17) ).
cnf(i_0_1,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_1) ).
cnf(i_0_10,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_10) ).
cnf(i_0_14,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ relation_of2(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_14) ).
cnf(i_0_2,plain,
( relation_of2(X1,X2,X3)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_2) ).
cnf(i_0_22,negated_conjecture,
relation_of2_as_subset(esk7_0,esk6_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_22) ).
cnf(i_0_24,plain,
( subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_24) ).
cnf(i_0_21,negated_conjecture,
subset(relation_rng(esk7_0),esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_21) ).
cnf(i_0_19,plain,
( subset(relation_dom(X1),X2)
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_19) ).
cnf(i_0_16,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_16) ).
cnf(i_0_20,negated_conjecture,
~ relation_of2_as_subset(esk7_0,esk6_0,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8dh54_jq/lgb.p',i_0_20) ).
cnf(c_0_39,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2(X1,X2,X3) ),
i_0_3 ).
cnf(c_0_40,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_15 ).
cnf(c_0_41,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
i_0_23 ).
cnf(c_0_42,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ subset(X2,X4)
| ~ subset(X1,X3) ),
i_0_17 ).
cnf(c_0_44,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
i_0_1 ).
cnf(c_0_45,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_10 ).
cnf(c_0_46,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ relation_of2(X1,X2,X3) ),
i_0_14 ).
cnf(c_0_47,plain,
( relation_of2(X1,X2,X3)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
i_0_2 ).
cnf(c_0_48,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2_as_subset(X4,X2,X3)
| ~ subset(X1,X4) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
relation_of2_as_subset(esk7_0,esk6_0,esk4_0),
i_0_22 ).
cnf(c_0_50,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ subset(X1,cartesian_product2(X4,X5))
| ~ subset(X5,X3)
| ~ subset(X4,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_51,plain,
( subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))
| ~ relation(X1) ),
i_0_24 ).
cnf(c_0_52,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_53,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( subset(X1,cartesian_product2(esk6_0,esk4_0))
| ~ subset(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation(X1)
| ~ subset(relation_rng(X1),X3)
| ~ subset(relation_dom(X1),X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
subset(relation_rng(esk7_0),esk5_0),
i_0_21 ).
cnf(c_0_57,negated_conjecture,
relation(esk7_0),
inference(spm,[status(thm)],[c_0_52,c_0_49]) ).
cnf(c_0_58,plain,
( subset(relation_dom(X1),X2)
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_19 ).
cnf(c_0_59,plain,
( relation_of2_as_subset(X1,esk6_0,esk4_0)
| ~ subset(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( subset(esk7_0,cartesian_product2(X1,esk5_0))
| ~ subset(relation_dom(esk7_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_61,plain,
( subset(relation_dom(X1),esk6_0)
| ~ subset(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,plain,
subset(X1,X1),
i_0_16 ).
cnf(c_0_63,plain,
subset(esk7_0,cartesian_product2(esk6_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_64,negated_conjecture,
~ relation_of2_as_subset(esk7_0,esk6_0,esk5_0),
i_0_20 ).
cnf(c_0_65,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_63]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU263+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 20:40:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.66/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.66/2.31 # No SInE strategy applied
% 7.66/2.31 # Trying AutoSched0 for 150 seconds
% 7.66/2.31 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.66/2.31 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.66/2.31 #
% 7.66/2.31 # Preprocessing time : 0.012 s
% 7.66/2.31 # Presaturation interreduction done
% 7.66/2.31
% 7.66/2.31 # Proof found!
% 7.66/2.31 # SZS status Theorem
% 7.66/2.31 # SZS output start CNFRefutation
% See solution above
% 7.66/2.31 # Training examples: 0 positive, 0 negative
% 7.66/2.31
% 7.66/2.31 # -------------------------------------------------
% 7.66/2.31 # User time : 0.037 s
% 7.66/2.31 # System time : 0.005 s
% 7.66/2.31 # Total time : 0.042 s
% 7.66/2.31 # Maximum resident set size: 7120 pages
% 7.66/2.31
%------------------------------------------------------------------------------