TSTP Solution File: SEU418+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU418+2 : TPTP v8.1.0. Released v3.4.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:42:10 EDT 2022
% Result : Theorem 12.30s 3.96s
% Output : CNFRefutation 12.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 28 unt; 0 def)
% Number of atoms : 99 ( 19 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 90 ( 38 ~; 31 |; 6 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 82 ( 3 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_relset_2,conjecture,
! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k5_relat_1(k3_xboole_0(X1,X2),X3),k3_xboole_0(k5_relat_1(X1,X3),k5_relat_1(X2,X3))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_relset_2) ).
fof(t48_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t48_xboole_1) ).
fof(t19_xboole_1,axiom,
! [X1,X2,X3] :
( ( r1_tarski(X1,X2)
& r1_tarski(X1,X3) )
=> r1_tarski(X1,k3_xboole_0(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t19_xboole_1) ).
fof(t50_relat_1,axiom,
! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> ! [X4] :
( v1_relat_1(X4)
=> ( ( r1_tarski(X1,X2)
& r1_tarski(X3,X4) )
=> r1_tarski(k5_relat_1(X1,X3),k5_relat_1(X2,X4)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+10.ax',t50_relat_1) ).
fof(t3_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ( r1_tarski(X1,X2)
=> v1_relat_1(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+10.ax',t3_relat_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+1.ax',reflexivity_r1_tarski) ).
fof(t2_boole,axiom,
! [X1] : k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+3.ax',t2_boole) ).
fof(t36_xboole_1,axiom,
! [X1,X2] : r1_tarski(k4_xboole_0(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t36_xboole_1) ).
fof(t49_xboole_1,axiom,
! [X1,X2,X3] : k3_xboole_0(X1,k4_xboole_0(X2,X3)) = k4_xboole_0(k3_xboole_0(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t49_xboole_1) ).
fof(t3_boole,axiom,
! [X1] : k4_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+3.ax',t3_boole) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( k4_xboole_0(X1,X2) = k1_xboole_0
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t37_xboole_1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( v1_relat_1(X1)
=> ! [X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k5_relat_1(k3_xboole_0(X1,X2),X3),k3_xboole_0(k5_relat_1(X1,X3),k5_relat_1(X2,X3))) ) ) ),
inference(assume_negation,[status(cth)],[t8_relset_2]) ).
fof(c_0_12,negated_conjecture,
( v1_relat_1(esk1_0)
& v1_relat_1(esk2_0)
& v1_relat_1(esk3_0)
& ~ r1_tarski(k5_relat_1(k3_xboole_0(esk1_0,esk2_0),esk3_0),k3_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X128,X129] : k4_xboole_0(X128,k4_xboole_0(X128,X129)) = k3_xboole_0(X128,X129),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_14,plain,
! [X88,X89,X90] :
( ~ r1_tarski(X88,X89)
| ~ r1_tarski(X88,X90)
| r1_tarski(X88,k3_xboole_0(X89,X90)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])]) ).
cnf(c_0_15,negated_conjecture,
~ r1_tarski(k5_relat_1(k3_xboole_0(esk1_0,esk2_0),esk3_0),k3_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( r1_tarski(X1,k3_xboole_0(X2,X3))
| ~ r1_tarski(X1,X2)
| ~ r1_tarski(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X240,X241,X242,X243] :
( ~ v1_relat_1(X240)
| ~ v1_relat_1(X241)
| ~ v1_relat_1(X242)
| ~ v1_relat_1(X243)
| ~ r1_tarski(X240,X241)
| ~ r1_tarski(X242,X243)
| r1_tarski(k5_relat_1(X240,X242),k5_relat_1(X241,X243)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t50_relat_1])])]) ).
fof(c_0_19,plain,
! [X29,X30] :
( ~ v1_relat_1(X30)
| ~ r1_tarski(X29,X30)
| v1_relat_1(X29) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_relat_1])]) ).
cnf(c_0_20,negated_conjecture,
~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k4_xboole_0(k5_relat_1(esk1_0,esk3_0),k4_xboole_0(k5_relat_1(esk1_0,esk3_0),k5_relat_1(esk2_0,esk3_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_21,plain,
( r1_tarski(X1,k4_xboole_0(X2,k4_xboole_0(X2,X3)))
| ~ r1_tarski(X1,X3)
| ~ r1_tarski(X1,X2) ),
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_22,plain,
( r1_tarski(k5_relat_1(X1,X3),k5_relat_1(X2,X4))
| ~ v1_relat_1(X1)
| ~ v1_relat_1(X2)
| ~ v1_relat_1(X3)
| ~ v1_relat_1(X4)
| ~ r1_tarski(X1,X2)
| ~ r1_tarski(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( v1_relat_1(X2)
| ~ v1_relat_1(X1)
| ~ r1_tarski(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_24,plain,
! [X23] : r1_tarski(X23,X23),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_25,plain,
! [X79] : k3_xboole_0(X79,k1_xboole_0) = k1_xboole_0,
inference(variable_rename,[status(thm)],[t2_boole]) ).
cnf(c_0_26,negated_conjecture,
( ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk2_0,esk3_0))
| ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( r1_tarski(k5_relat_1(X1,X2),k5_relat_1(X3,X4))
| ~ v1_relat_1(X4)
| ~ v1_relat_1(X3)
| ~ r1_tarski(X2,X4)
| ~ r1_tarski(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
v1_relat_1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,negated_conjecture,
v1_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_31,plain,
! [X510,X511] : r1_tarski(k4_xboole_0(X510,X511),X510),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
fof(c_0_32,plain,
! [X130,X131,X132] : k3_xboole_0(X130,k4_xboole_0(X131,X132)) = k4_xboole_0(k3_xboole_0(X130,X131),X132),
inference(variable_rename,[status(thm)],[t49_xboole_1]) ).
cnf(c_0_33,plain,
k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_34,plain,
! [X496] : k4_xboole_0(X496,k1_xboole_0) = X496,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_35,negated_conjecture,
( ~ r1_tarski(k5_relat_1(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk3_0),k5_relat_1(esk1_0,esk3_0))
| ~ r1_tarski(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_36,negated_conjecture,
v1_relat_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,plain,
r1_tarski(k4_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_38,plain,
! [X512,X513] :
( ( k4_xboole_0(X512,X513) != k1_xboole_0
| r1_tarski(X512,X513) )
& ( ~ r1_tarski(X512,X513)
| k4_xboole_0(X512,X513) = k1_xboole_0 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])]) ).
cnf(c_0_39,plain,
k3_xboole_0(X1,k4_xboole_0(X2,X3)) = k4_xboole_0(k3_xboole_0(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
k4_xboole_0(X1,k4_xboole_0(X1,k1_xboole_0)) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_41,plain,
k4_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
~ r1_tarski(k4_xboole_0(esk1_0,k4_xboole_0(esk1_0,esk2_0)),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_27]),c_0_28]),c_0_36]),c_0_30]),c_0_37])]) ).
cnf(c_0_43,plain,
( r1_tarski(X1,X2)
| k4_xboole_0(X1,X2) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,plain,
k4_xboole_0(X1,k4_xboole_0(X1,k4_xboole_0(X2,X3))) = k4_xboole_0(k4_xboole_0(X1,k4_xboole_0(X1,X2)),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_16]),c_0_16]) ).
cnf(c_0_45,plain,
k4_xboole_0(X1,X1) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),c_0_41]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU418+2 : TPTP v8.1.0. Released v3.4.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 21:09:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.41/0.59 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.41/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.41/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.30/3.96 # ENIGMATIC: Solved by autoschedule:
% 12.30/3.96 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 12.30/3.96 # Trying AutoSched0 for 150 seconds
% 12.30/3.96 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y
% 12.30/3.96 # and selection function SelectMaxLComplexAvoidPosPred.
% 12.30/3.96 #
% 12.30/3.96 # Preprocessing time : 0.067 s
% 12.30/3.96
% 12.30/3.96 # Proof found!
% 12.30/3.96 # SZS status Theorem
% 12.30/3.96 # SZS output start CNFRefutation
% See solution above
% 12.30/3.96 # Training examples: 0 positive, 0 negative
% 12.30/3.96
% 12.30/3.96 # -------------------------------------------------
% 12.30/3.96 # User time : 0.411 s
% 12.30/3.96 # System time : 0.026 s
% 12.30/3.96 # Total time : 0.437 s
% 12.30/3.96 # Maximum resident set size: 10144 pages
% 12.30/3.96
%------------------------------------------------------------------------------