TSTP Solution File: SEU420+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU420+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:26:26 EDT 2023
% Result : Theorem 5.13s 1.79s
% Output : CNFRefutation 5.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 27 unt; 0 def)
% Number of atoms : 88 ( 19 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 75 ( 33 ~; 26 |; 5 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 82 ( 3 sgn; 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_relset_2,conjecture,
! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k9_relat_1(k3_xboole_0(X2,X3),k3_pua2mss1(X1)),k3_xboole_0(k9_relat_1(X2,k3_pua2mss1(X1)),k9_relat_1(X3,k3_pua2mss1(X1)))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',t13_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/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',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/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',t19_xboole_1) ).
fof(t158_relat_1,axiom,
! [X1,X2,X3] :
( v1_relat_1(X3)
=> ! [X4] :
( v1_relat_1(X4)
=> ( ( r1_tarski(X3,X4)
& r1_tarski(X1,X2) )
=> r1_tarski(k9_relat_1(X3,X1),k9_relat_1(X4,X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',t158_relat_1) ).
fof(t3_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ( r1_tarski(X1,X2)
=> v1_relat_1(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',t3_relat_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : r1_tarski(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',reflexivity_r1_tarski) ).
fof(t2_boole,axiom,
! [X1] : k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
file('/export/starexec/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',t2_boole) ).
fof(t36_xboole_1,axiom,
! [X1,X2] : r1_tarski(k4_xboole_0(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',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/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',t49_xboole_1) ).
fof(t3_boole,axiom,
! [X1] : k4_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',t3_boole) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( k4_xboole_0(X1,X2) = k1_xboole_0
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p',t37_xboole_1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k9_relat_1(k3_xboole_0(X2,X3),k3_pua2mss1(X1)),k3_xboole_0(k9_relat_1(X2,k3_pua2mss1(X1)),k9_relat_1(X3,k3_pua2mss1(X1)))) ) ),
inference(assume_negation,[status(cth)],[t13_relset_2]) ).
fof(c_0_12,negated_conjecture,
( v1_relat_1(esk2_0)
& v1_relat_1(esk3_0)
& ~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k3_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_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(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k3_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_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,
! [X259,X260,X261,X262] :
( ~ v1_relat_1(X261)
| ~ v1_relat_1(X262)
| ~ r1_tarski(X261,X262)
| ~ r1_tarski(X259,X260)
| r1_tarski(k9_relat_1(X261,X259),k9_relat_1(X262,X260)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t158_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(k9_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),k3_pua2mss1(esk1_0)),k4_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k4_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_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(k9_relat_1(X1,X3),k9_relat_1(X2,X4))
| ~ v1_relat_1(X1)
| ~ v1_relat_1(X2)
| ~ 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(k9_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0)))
| ~ r1_tarski(k9_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),k3_pua2mss1(esk1_0)),k9_relat_1(esk2_0,k3_pua2mss1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( r1_tarski(k9_relat_1(X1,X2),k9_relat_1(X3,X4))
| ~ v1_relat_1(X3)
| ~ r1_tarski(X2,X4)
| ~ r1_tarski(X1,X3) ),
inference(csr,[status(thm)],[c_0_22,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,plain,
r1_tarski(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,plain,
! [X583,X584] : r1_tarski(k4_xboole_0(X583,X584),X583),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
fof(c_0_31,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_32,plain,
k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X569] : k4_xboole_0(X569,k1_xboole_0) = X569,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_34,negated_conjecture,
( ~ r1_tarski(k9_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),k3_pua2mss1(esk1_0)),k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)))
| ~ r1_tarski(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),esk3_0) ),
inference(cn,[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])]) ).
cnf(c_0_35,negated_conjecture,
v1_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,plain,
r1_tarski(k4_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_37,plain,
! [X585,X586] :
( ( k4_xboole_0(X585,X586) != k1_xboole_0
| r1_tarski(X585,X586) )
& ( ~ r1_tarski(X585,X586)
| k4_xboole_0(X585,X586) = k1_xboole_0 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])]) ).
cnf(c_0_38,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_31]) ).
cnf(c_0_39,plain,
k4_xboole_0(X1,k4_xboole_0(X1,k1_xboole_0)) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_32,c_0_16]) ).
cnf(c_0_40,plain,
k4_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ r1_tarski(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_35]),c_0_29]),c_0_36])]) ).
cnf(c_0_42,plain,
( r1_tarski(X1,X2)
| k4_xboole_0(X1,X2) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,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_38,c_0_16]),c_0_16]) ).
cnf(c_0_44,plain,
k4_xboole_0(X1,X1) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,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_41,c_0_42]),c_0_43]),c_0_44]),c_0_40]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.37 % Problem : SEU420+2 : TPTP v8.1.2. Released v3.4.0.
% 0.12/0.38 % Command : run_E %s %d THM
% 0.40/0.59 % Computer : n016.cluster.edu
% 0.40/0.59 % Model : x86_64 x86_64
% 0.40/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.40/0.59 % Memory : 8042.1875MB
% 0.40/0.59 % OS : Linux 3.10.0-693.el7.x86_64
% 0.40/0.59 % CPULimit : 2400
% 0.40/0.59 % WCLimit : 300
% 0.40/0.59 % DateTime : Mon Oct 2 10:02:37 EDT 2023
% 0.40/0.59 % CPUTime :
% 0.94/1.09 Running first-order theorem proving
% 0.94/1.09 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.chgNztoEvo/E---3.1_30611.p
% 5.13/1.79 # Version: 3.1pre001
% 5.13/1.79 # Preprocessing class: FMLMSMLLSSSNFFN.
% 5.13/1.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.13/1.79 # Starting new_bool_3 with 900s (3) cores
% 5.13/1.79 # Starting new_bool_1 with 900s (3) cores
% 5.13/1.79 # Starting sh5l with 300s (1) cores
% 5.13/1.79 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 5.13/1.79 # G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 30693 completed with status 0
% 5.13/1.79 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 5.13/1.79 # Preprocessing class: FMLMSMLLSSSNFFN.
% 5.13/1.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.13/1.79 # Starting new_bool_3 with 900s (3) cores
% 5.13/1.79 # Starting new_bool_1 with 900s (3) cores
% 5.13/1.79 # Starting sh5l with 300s (1) cores
% 5.13/1.79 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 5.13/1.79 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 5.13/1.79 # Search class: FGHSM-FSLM32-MFFFFFNN
% 5.13/1.79 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 5.13/1.79 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 5.13/1.79 # G-E--_303_C18_F1_URBAN_S0Y with pid 30694 completed with status 0
% 5.13/1.79 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 5.13/1.79 # Preprocessing class: FMLMSMLLSSSNFFN.
% 5.13/1.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.13/1.79 # Starting new_bool_3 with 900s (3) cores
% 5.13/1.79 # Starting new_bool_1 with 900s (3) cores
% 5.13/1.79 # Starting sh5l with 300s (1) cores
% 5.13/1.79 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 5.13/1.79 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 5.13/1.79 # Search class: FGHSM-FSLM32-MFFFFFNN
% 5.13/1.79 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 5.13/1.79 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 5.13/1.79 # Preprocessing time : 0.035 s
% 5.13/1.79
% 5.13/1.79 # Proof found!
% 5.13/1.79 # SZS status Theorem
% 5.13/1.79 # SZS output start CNFRefutation
% See solution above
% 5.13/1.79 # Parsed axioms : 4482
% 5.13/1.79 # Removed by relevancy pruning/SinE : 3981
% 5.13/1.79 # Initial clauses : 846
% 5.13/1.79 # Removed in clause preprocessing : 23
% 5.13/1.79 # Initial clauses in saturation : 823
% 5.13/1.79 # Processed clauses : 927
% 5.13/1.79 # ...of these trivial : 25
% 5.13/1.79 # ...subsumed : 102
% 5.13/1.79 # ...remaining for further processing : 800
% 5.13/1.79 # Other redundant clauses eliminated : 88
% 5.13/1.79 # Clauses deleted for lack of memory : 0
% 5.13/1.79 # Backward-subsumed : 10
% 5.13/1.79 # Backward-rewritten : 12
% 5.13/1.79 # Generated clauses : 18171
% 5.13/1.79 # ...of the previous two non-redundant : 16676
% 5.13/1.79 # ...aggressively subsumed : 0
% 5.13/1.79 # Contextual simplify-reflections : 14
% 5.13/1.79 # Paramodulations : 18023
% 5.13/1.79 # Factorizations : 19
% 5.13/1.79 # NegExts : 0
% 5.13/1.79 # Equation resolutions : 130
% 5.13/1.79 # Total rewrite steps : 6310
% 5.13/1.79 # Propositional unsat checks : 0
% 5.13/1.79 # Propositional check models : 0
% 5.13/1.79 # Propositional check unsatisfiable : 0
% 5.13/1.79 # Propositional clauses : 0
% 5.13/1.79 # Propositional clauses after purity: 0
% 5.13/1.79 # Propositional unsat core size : 0
% 5.13/1.79 # Propositional preprocessing time : 0.000
% 5.13/1.79 # Propositional encoding time : 0.000
% 5.13/1.79 # Propositional solver time : 0.000
% 5.13/1.79 # Success case prop preproc time : 0.000
% 5.13/1.79 # Success case prop encoding time : 0.000
% 5.13/1.79 # Success case prop solver time : 0.000
% 5.13/1.79 # Current number of processed clauses : 767
% 5.13/1.79 # Positive orientable unit clauses : 75
% 5.13/1.79 # Positive unorientable unit clauses: 4
% 5.13/1.79 # Negative unit clauses : 23
% 5.13/1.79 # Non-unit-clauses : 665
% 5.13/1.79 # Current number of unprocessed clauses: 16549
% 5.13/1.79 # ...number of literals in the above : 68591
% 5.13/1.79 # Current number of archived formulas : 0
% 5.13/1.79 # Current number of archived clauses : 24
% 5.13/1.79 # Clause-clause subsumption calls (NU) : 114121
% 5.13/1.79 # Rec. Clause-clause subsumption calls : 36301
% 5.13/1.79 # Non-unit clause-clause subsumptions : 82
% 5.13/1.79 # Unit Clause-clause subsumption calls : 6113
% 5.13/1.79 # Rewrite failures with RHS unbound : 0
% 5.13/1.79 # BW rewrite match attempts : 93
% 5.13/1.79 # BW rewrite match successes : 49
% 5.13/1.79 # Condensation attempts : 0
% 5.13/1.79 # Condensation successes : 0
% 5.13/1.79 # Termbank termtop insertions : 405854
% 5.13/1.79
% 5.13/1.79 # -------------------------------------------------
% 5.13/1.79 # User time : 0.587 s
% 5.13/1.79 # System time : 0.018 s
% 5.13/1.79 # Total time : 0.605 s
% 5.13/1.79 # Maximum resident set size: 9816 pages
% 5.13/1.79
% 5.13/1.79 # -------------------------------------------------
% 5.13/1.79 # User time : 0.660 s
% 5.13/1.79 # System time : 0.021 s
% 5.13/1.79 # Total time : 0.681 s
% 5.13/1.79 # Maximum resident set size: 7140 pages
% 5.13/1.79 % E---3.1 exiting
% 5.13/1.80 % E---3.1 exiting
%------------------------------------------------------------------------------