TSTP Solution File: SEU427+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU427+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:32:07 EDT 2023
% Result : Theorem 4.78s 1.51s
% Output : CNFRefutation 4.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 14 unt; 0 def)
% Number of atoms : 65 ( 29 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 59 ( 22 ~; 18 |; 6 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-4 aty)
% Number of variables : 51 ( 1 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t26_relset_2,conjecture,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X1))
=> ! [X5] :
( m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( k4_relset_2(k1_zfmisc_1(X1),X2,k6_relset_2(X2,X1,X5),k3_pua2mss1(X3)) = k1_xboole_0
=> k8_relset_2(X1,X2,k4_subset_1(X1,X3,X4),X5) = k8_relset_2(X1,X2,X4,X5) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.W9STtHgcHd/E---3.1_5668.p',t26_relset_2) ).
fof(redefinition_k4_subset_1,axiom,
! [X1,X2,X3] :
( ( m1_subset_1(X2,k1_zfmisc_1(X1))
& m1_subset_1(X3,k1_zfmisc_1(X1)) )
=> k4_subset_1(X1,X2,X3) = k2_xboole_0(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.W9STtHgcHd/E---3.1_5668.p',redefinition_k4_subset_1) ).
fof(t93_zfmisc_1,axiom,
! [X1,X2] : k3_tarski(k2_tarski(X1,X2)) = k2_xboole_0(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.W9STtHgcHd/E---3.1_5668.p',t93_zfmisc_1) ).
fof(t23_relset_2,axiom,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( k4_relset_2(k1_zfmisc_1(X1),X2,k6_relset_2(X2,X1,X4),k3_pua2mss1(X3)) = k1_xboole_0
<=> X3 = k1_xboole_0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.W9STtHgcHd/E---3.1_5668.p',t23_relset_2) ).
fof(t12_xboole_1,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
=> k2_xboole_0(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.W9STtHgcHd/E---3.1_5668.p',t12_xboole_1) ).
fof(t2_xboole_1,axiom,
! [X1] : r1_tarski(k1_xboole_0,X1),
file('/export/starexec/sandbox/tmp/tmp.W9STtHgcHd/E---3.1_5668.p',t2_xboole_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X1))
=> ! [X5] :
( m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( k4_relset_2(k1_zfmisc_1(X1),X2,k6_relset_2(X2,X1,X5),k3_pua2mss1(X3)) = k1_xboole_0
=> k8_relset_2(X1,X2,k4_subset_1(X1,X3,X4),X5) = k8_relset_2(X1,X2,X4,X5) ) ) ) ),
inference(assume_negation,[status(cth)],[t26_relset_2]) ).
fof(c_0_7,plain,
! [X59,X60,X61] :
( ~ m1_subset_1(X60,k1_zfmisc_1(X59))
| ~ m1_subset_1(X61,k1_zfmisc_1(X59))
| k4_subset_1(X59,X60,X61) = k2_xboole_0(X60,X61) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_subset_1])]) ).
fof(c_0_8,plain,
! [X867,X868] : k3_tarski(k2_tarski(X867,X868)) = k2_xboole_0(X867,X868),
inference(variable_rename,[status(thm)],[t93_zfmisc_1]) ).
fof(c_0_9,plain,
! [X107,X108,X109,X110] :
( ( k4_relset_2(k1_zfmisc_1(X107),X108,k6_relset_2(X108,X107,X110),k3_pua2mss1(X109)) != k1_xboole_0
| X109 = k1_xboole_0
| ~ m1_subset_1(X110,k1_zfmisc_1(k2_zfmisc_1(X107,X108)))
| ~ m1_subset_1(X109,k1_zfmisc_1(X107)) )
& ( X109 != k1_xboole_0
| k4_relset_2(k1_zfmisc_1(X107),X108,k6_relset_2(X108,X107,X110),k3_pua2mss1(X109)) = k1_xboole_0
| ~ m1_subset_1(X110,k1_zfmisc_1(k2_zfmisc_1(X107,X108)))
| ~ m1_subset_1(X109,k1_zfmisc_1(X107)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_relset_2])])])]) ).
fof(c_0_10,negated_conjecture,
( m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0))
& m1_subset_1(esk4_0,k1_zfmisc_1(esk1_0))
& m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))
& k4_relset_2(k1_zfmisc_1(esk1_0),esk2_0,k6_relset_2(esk2_0,esk1_0,esk5_0),k3_pua2mss1(esk3_0)) = k1_xboole_0
& k8_relset_2(esk1_0,esk2_0,k4_subset_1(esk1_0,esk3_0,esk4_0),esk5_0) != k8_relset_2(esk1_0,esk2_0,esk4_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( k4_subset_1(X2,X1,X3) = k2_xboole_0(X1,X3)
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
k3_tarski(k2_tarski(X1,X2)) = k2_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( X4 = k1_xboole_0
| k4_relset_2(k1_zfmisc_1(X1),X2,k6_relset_2(X2,X1,X3),k3_pua2mss1(X4)) != k1_xboole_0
| ~ m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
| ~ m1_subset_1(X4,k1_zfmisc_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
k4_relset_2(k1_zfmisc_1(esk1_0),esk2_0,k6_relset_2(esk2_0,esk1_0,esk5_0),k3_pua2mss1(esk3_0)) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X681,X682] :
( ~ r1_tarski(X681,X682)
| k2_xboole_0(X681,X682) = X682 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
cnf(c_0_18,negated_conjecture,
k8_relset_2(esk1_0,esk2_0,k4_subset_1(esk1_0,esk3_0,esk4_0),esk5_0) != k8_relset_2(esk1_0,esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( k4_subset_1(X2,X1,X3) = k3_tarski(k2_tarski(X1,X3))
| ~ m1_subset_1(X3,k1_zfmisc_1(X2))
| ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
esk3_0 = k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_22,plain,
( k2_xboole_0(X1,X2) = X2
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X72] : r1_tarski(k1_xboole_0,X72),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_24,negated_conjecture,
k8_relset_2(esk1_0,esk2_0,k3_tarski(k2_tarski(k1_xboole_0,esk4_0)),esk5_0) != k8_relset_2(esk1_0,esk2_0,esk4_0,esk5_0),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_16])]),c_0_21]) ).
cnf(c_0_25,plain,
( k3_tarski(k2_tarski(X1,X2)) = X2
| ~ r1_tarski(X1,X2) ),
inference(rw,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_26,plain,
r1_tarski(k1_xboole_0,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU427+2 : TPTP v8.1.2. Released v3.4.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:41:01 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.52/0.74 Running first-order model finding
% 0.52/0.74 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.W9STtHgcHd/E---3.1_5668.p
% 4.78/1.51 # Version: 3.1pre001
% 4.78/1.51 # Preprocessing class: FMLMSMLLSSSNFFN.
% 4.78/1.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.78/1.51 # Starting new_bool_3 with 900s (3) cores
% 4.78/1.51 # Starting new_bool_1 with 900s (3) cores
% 4.78/1.51 # Starting sh5l with 300s (1) cores
% 4.78/1.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 4.78/1.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 5750 completed with status 0
% 4.78/1.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 4.78/1.51 # Preprocessing class: FMLMSMLLSSSNFFN.
% 4.78/1.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.78/1.51 # Starting new_bool_3 with 900s (3) cores
% 4.78/1.51 # Starting new_bool_1 with 900s (3) cores
% 4.78/1.51 # Starting sh5l with 300s (1) cores
% 4.78/1.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 4.78/1.51 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 4.78/1.51 # Search class: FGHSM-FSLM32-DFFFFFNN
% 4.78/1.51 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.78/1.51 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 4.78/1.51 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 5751 completed with status 0
% 4.78/1.51 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 4.78/1.51 # Preprocessing class: FMLMSMLLSSSNFFN.
% 4.78/1.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.78/1.51 # Starting new_bool_3 with 900s (3) cores
% 4.78/1.51 # Starting new_bool_1 with 900s (3) cores
% 4.78/1.51 # Starting sh5l with 300s (1) cores
% 4.78/1.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 4.78/1.51 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 4.78/1.51 # Search class: FGHSM-FSLM32-DFFFFFNN
% 4.78/1.51 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.78/1.51 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 4.78/1.51 # Preprocessing time : 0.025 s
% 4.78/1.51
% 4.78/1.51 # Proof found!
% 4.78/1.51 # SZS status Theorem
% 4.78/1.51 # SZS output start CNFRefutation
% See solution above
% 4.78/1.51 # Parsed axioms : 4498
% 4.78/1.51 # Removed by relevancy pruning/SinE : 3997
% 4.78/1.51 # Initial clauses : 855
% 4.78/1.51 # Removed in clause preprocessing : 23
% 4.78/1.51 # Initial clauses in saturation : 832
% 4.78/1.51 # Processed clauses : 1075
% 4.78/1.51 # ...of these trivial : 27
% 4.78/1.51 # ...subsumed : 139
% 4.78/1.51 # ...remaining for further processing : 909
% 4.78/1.51 # Other redundant clauses eliminated : 71
% 4.78/1.51 # Clauses deleted for lack of memory : 0
% 4.78/1.51 # Backward-subsumed : 18
% 4.78/1.51 # Backward-rewritten : 16
% 4.78/1.51 # Generated clauses : 17691
% 4.78/1.51 # ...of the previous two non-redundant : 16325
% 4.78/1.51 # ...aggressively subsumed : 0
% 4.78/1.51 # Contextual simplify-reflections : 13
% 4.78/1.51 # Paramodulations : 17561
% 4.78/1.51 # Factorizations : 19
% 4.78/1.51 # NegExts : 0
% 4.78/1.51 # Equation resolutions : 112
% 4.78/1.51 # Total rewrite steps : 5770
% 4.78/1.51 # Propositional unsat checks : 0
% 4.78/1.51 # Propositional check models : 0
% 4.78/1.51 # Propositional check unsatisfiable : 0
% 4.78/1.51 # Propositional clauses : 0
% 4.78/1.51 # Propositional clauses after purity: 0
% 4.78/1.51 # Propositional unsat core size : 0
% 4.78/1.51 # Propositional preprocessing time : 0.000
% 4.78/1.51 # Propositional encoding time : 0.000
% 4.78/1.51 # Propositional solver time : 0.000
% 4.78/1.51 # Success case prop preproc time : 0.000
% 4.78/1.51 # Success case prop encoding time : 0.000
% 4.78/1.51 # Success case prop solver time : 0.000
% 4.78/1.51 # Current number of processed clauses : 867
% 4.78/1.51 # Positive orientable unit clauses : 98
% 4.78/1.51 # Positive unorientable unit clauses: 3
% 4.78/1.51 # Negative unit clauses : 23
% 4.78/1.51 # Non-unit-clauses : 743
% 4.78/1.51 # Current number of unprocessed clauses: 16053
% 4.78/1.51 # ...number of literals in the above : 63732
% 4.78/1.51 # Current number of archived formulas : 0
% 4.78/1.51 # Current number of archived clauses : 36
% 4.78/1.51 # Clause-clause subsumption calls (NU) : 125948
% 4.78/1.51 # Rec. Clause-clause subsumption calls : 46159
% 4.78/1.51 # Non-unit clause-clause subsumptions : 109
% 4.78/1.51 # Unit Clause-clause subsumption calls : 9115
% 4.78/1.51 # Rewrite failures with RHS unbound : 0
% 4.78/1.51 # BW rewrite match attempts : 98
% 4.78/1.51 # BW rewrite match successes : 48
% 4.78/1.51 # Condensation attempts : 0
% 4.78/1.51 # Condensation successes : 0
% 4.78/1.51 # Termbank termtop insertions : 396895
% 4.78/1.51
% 4.78/1.51 # -------------------------------------------------
% 4.78/1.51 # User time : 0.586 s
% 4.78/1.51 # System time : 0.032 s
% 4.78/1.51 # Total time : 0.618 s
% 4.78/1.51 # Maximum resident set size: 9844 pages
% 4.78/1.51
% 4.78/1.51 # -------------------------------------------------
% 4.78/1.51 # User time : 0.709 s
% 4.78/1.51 # System time : 0.038 s
% 4.78/1.51 # Total time : 0.747 s
% 4.78/1.51 # Maximum resident set size: 7164 pages
% 4.78/1.51 % E---3.1 exiting
%------------------------------------------------------------------------------