TSTP Solution File: SET971+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET971+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 00:15:36 EDT 2022
% Result : Theorem 7.91s 2.36s
% Output : CNFRefutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 21 unt; 0 nHn; 11 RR)
% Number of literals : 25 ( 18 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oa7e6gtk/input.p',i_0_6) ).
cnf(i_0_2,plain,
set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oa7e6gtk/input.p',i_0_2) ).
cnf(i_0_10,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oa7e6gtk/input.p',i_0_10) ).
cnf(i_0_8,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oa7e6gtk/input.p',i_0_8) ).
cnf(i_0_1,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oa7e6gtk/input.p',i_0_1) ).
cnf(i_0_9,negated_conjecture,
subset(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oa7e6gtk/input.p',i_0_9) ).
cnf(i_0_7,negated_conjecture,
set_intersection2(cartesian_product2(esk3_0,esk6_0),cartesian_product2(esk4_0,esk5_0)) != cartesian_product2(esk3_0,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oa7e6gtk/input.p',i_0_7) ).
cnf(c_0_18,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
i_0_6 ).
cnf(c_0_19,plain,
set_intersection2(X1,X1) = X1,
i_0_2 ).
cnf(c_0_20,plain,
cartesian_product2(set_intersection2(X1,X2),X3) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X3)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
i_0_10 ).
cnf(c_0_22,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_8 ).
cnf(c_0_23,plain,
set_intersection2(cartesian_product2(X1,set_intersection2(X2,X3)),cartesian_product2(X4,set_intersection2(X2,X3))) = set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X4,X3)),
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
set_intersection2(esk5_0,esk6_0) = esk5_0,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_1 ).
cnf(c_0_26,negated_conjecture,
set_intersection2(cartesian_product2(X1,esk5_0),cartesian_product2(X2,esk6_0)) = set_intersection2(cartesian_product2(X1,esk5_0),cartesian_product2(X2,esk5_0)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
subset(esk3_0,esk4_0),
i_0_9 ).
cnf(c_0_28,plain,
set_intersection2(cartesian_product2(X1,esk5_0),cartesian_product2(X2,esk5_0)) = set_intersection2(cartesian_product2(X2,esk6_0),cartesian_product2(X1,esk5_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
set_intersection2(esk3_0,esk4_0) = esk3_0,
inference(spm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
set_intersection2(cartesian_product2(esk3_0,esk6_0),cartesian_product2(esk4_0,esk5_0)) != cartesian_product2(esk3_0,esk5_0),
i_0_7 ).
cnf(c_0_31,plain,
set_intersection2(cartesian_product2(X1,esk6_0),cartesian_product2(X2,esk5_0)) = set_intersection2(cartesian_product2(X1,esk5_0),cartesian_product2(X2,esk5_0)),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
set_intersection2(cartesian_product2(esk3_0,X1),cartesian_product2(esk4_0,X1)) = cartesian_product2(esk3_0,X1),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET971+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/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 : Sun Jul 10 08:24:30 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.91/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.91/2.36 # No SInE strategy applied
% 7.91/2.36 # Trying AutoSched0 for 150 seconds
% 7.91/2.36 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_AE_CS_SP_PI_S0S
% 7.91/2.36 # and selection function SelectComplexG.
% 7.91/2.36 #
% 7.91/2.36 # Preprocessing time : 0.017 s
% 7.91/2.36
% 7.91/2.36 # Proof found!
% 7.91/2.36 # SZS status Theorem
% 7.91/2.36 # SZS output start CNFRefutation
% See solution above
% 7.91/2.36 # Training examples: 0 positive, 0 negative
% 7.91/2.36
% 7.91/2.36 # -------------------------------------------------
% 7.91/2.36 # User time : 0.018 s
% 7.91/2.36 # System time : 0.006 s
% 7.91/2.36 # Total time : 0.024 s
% 7.91/2.36 # Maximum resident set size: 7116 pages
% 7.91/2.36
%------------------------------------------------------------------------------