TSTP Solution File: SEU427+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU427+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:08 EDT 2023
% Result : Theorem 6.46s 3.01s
% Output : CNFRefutation 6.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 18 unt; 0 def)
% Number of atoms : 73 ( 35 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 65 ( 25 ~; 21 |; 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 : 18 ( 18 usr; 6 con; 0-4 aty)
% Number of variables : 58 ( 1 sgn; 36 !; 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.r0CG8B6Rs1/E---3.1_19770.p',t26_relset_2) ).
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.r0CG8B6Rs1/E---3.1_19770.p',t23_relset_2) ).
fof(d2_pua2mss1,axiom,
! [X1] : k3_pua2mss1(X1) = k8_eqrel_1(X1,k6_partfun1(X1)),
file('/export/starexec/sandbox/tmp/tmp.r0CG8B6Rs1/E---3.1_19770.p',d2_pua2mss1) ).
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.r0CG8B6Rs1/E---3.1_19770.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.r0CG8B6Rs1/E---3.1_19770.p',t93_zfmisc_1) ).
fof(t12_xboole_1,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
=> k2_xboole_0(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.r0CG8B6Rs1/E---3.1_19770.p',t12_xboole_1) ).
fof(t2_xboole_1,axiom,
! [X1] : r1_tarski(k1_xboole_0,X1),
file('/export/starexec/sandbox/tmp/tmp.r0CG8B6Rs1/E---3.1_19770.p',t2_xboole_1) ).
fof(c_0_7,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_8,plain,
! [X150,X151,X152,X153] :
( ( k4_relset_2(k1_zfmisc_1(X150),X151,k6_relset_2(X151,X150,X153),k3_pua2mss1(X152)) != k1_xboole_0
| X152 = k1_xboole_0
| ~ m1_subset_1(X153,k1_zfmisc_1(k2_zfmisc_1(X150,X151)))
| ~ m1_subset_1(X152,k1_zfmisc_1(X150)) )
& ( X152 != k1_xboole_0
| k4_relset_2(k1_zfmisc_1(X150),X151,k6_relset_2(X151,X150,X153),k3_pua2mss1(X152)) = k1_xboole_0
| ~ m1_subset_1(X153,k1_zfmisc_1(k2_zfmisc_1(X150,X151)))
| ~ m1_subset_1(X152,k1_zfmisc_1(X150)) ) ),
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_9,plain,
! [X154] : k3_pua2mss1(X154) = k8_eqrel_1(X154,k6_partfun1(X154)),
inference(variable_rename,[status(thm)],[d2_pua2mss1]) ).
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_7])])]) ).
fof(c_0_11,plain,
! [X60,X61,X62] :
( ~ m1_subset_1(X61,k1_zfmisc_1(X60))
| ~ m1_subset_1(X62,k1_zfmisc_1(X60))
| k4_subset_1(X60,X61,X62) = k2_xboole_0(X61,X62) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_subset_1])]) ).
fof(c_0_12,plain,
! [X1171,X1172] : k3_tarski(k2_tarski(X1171,X1172)) = k2_xboole_0(X1171,X1172),
inference(variable_rename,[status(thm)],[t93_zfmisc_1]) ).
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_8]) ).
cnf(c_0_14,plain,
k3_pua2mss1(X1) = k8_eqrel_1(X1,k6_partfun1(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,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_16,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_11]) ).
cnf(c_0_17,plain,
k3_tarski(k2_tarski(X1,X2)) = k2_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( X4 = k1_xboole_0
| k4_relset_2(k1_zfmisc_1(X1),X2,k6_relset_2(X2,X1,X3),k8_eqrel_1(X4,k6_partfun1(X4))) != k1_xboole_0
| ~ m1_subset_1(X4,k1_zfmisc_1(X1))
| ~ m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
k4_relset_2(k1_zfmisc_1(esk1_0),esk2_0,k6_relset_2(esk2_0,esk1_0,esk5_0),k8_eqrel_1(esk3_0,k6_partfun1(esk3_0))) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_20,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_21,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,plain,
! [X781,X782] :
( ~ r1_tarski(X781,X782)
| k2_xboole_0(X781,X782) = X782 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
cnf(c_0_23,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_24,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_16,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,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_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_27,plain,
( k2_xboole_0(X1,X2) = X2
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,plain,
! [X88] : r1_tarski(k1_xboole_0,X88),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_29,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_23,c_0_24]),c_0_25]),c_0_21])]),c_0_26]) ).
cnf(c_0_30,plain,
( k3_tarski(k2_tarski(X1,X2)) = X2
| ~ r1_tarski(X1,X2) ),
inference(rw,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_31,plain,
r1_tarski(k1_xboole_0,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU427+3 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 09:09:32 EDT 2023
% 0.13/0.35 % CPUTime :
% 1.46/1.66 Running first-order model finding
% 1.46/1.66 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.r0CG8B6Rs1/E---3.1_19770.p
% 6.46/3.01 # Version: 3.1pre001
% 6.46/3.01 # Preprocessing class: FMLLMMLLSSSNFFN.
% 6.46/3.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.46/3.01 # Starting new_bool_3 with 900s (3) cores
% 6.46/3.01 # Starting new_bool_1 with 900s (3) cores
% 6.46/3.01 # Starting sh5l with 300s (1) cores
% 6.46/3.01 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 6.46/3.01 # G-E--_211_C18_F1_AE_CS_SP_S0Y with pid 19886 completed with status 0
% 6.46/3.01 # Result found by G-E--_211_C18_F1_AE_CS_SP_S0Y
% 6.46/3.01 # Preprocessing class: FMLLMMLLSSSNFFN.
% 6.46/3.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.46/3.01 # Starting new_bool_3 with 900s (3) cores
% 6.46/3.01 # Starting new_bool_1 with 900s (3) cores
% 6.46/3.01 # Starting sh5l with 300s (1) cores
% 6.46/3.01 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 6.46/3.01 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 6.46/3.01 # Search class: FGHSM-FSLM32-DFFFFFNN
% 6.46/3.01 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 6.46/3.01 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 6.46/3.01 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 19887 completed with status 0
% 6.46/3.01 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 6.46/3.01 # Preprocessing class: FMLLMMLLSSSNFFN.
% 6.46/3.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.46/3.01 # Starting new_bool_3 with 900s (3) cores
% 6.46/3.01 # Starting new_bool_1 with 900s (3) cores
% 6.46/3.01 # Starting sh5l with 300s (1) cores
% 6.46/3.01 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 6.46/3.01 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 6.46/3.01 # Search class: FGHSM-FSLM32-DFFFFFNN
% 6.46/3.01 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 6.46/3.01 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 6.46/3.01 # Preprocessing time : 0.073 s
% 6.46/3.01
% 6.46/3.01 # Proof found!
% 6.46/3.01 # SZS status Theorem
% 6.46/3.01 # SZS output start CNFRefutation
% See solution above
% 6.46/3.01 # Parsed axioms : 19097
% 6.46/3.01 # Removed by relevancy pruning/SinE : 18596
% 6.46/3.01 # Initial clauses : 946
% 6.46/3.01 # Removed in clause preprocessing : 11
% 6.46/3.01 # Initial clauses in saturation : 935
% 6.46/3.01 # Processed clauses : 1328
% 6.46/3.01 # ...of these trivial : 31
% 6.46/3.01 # ...subsumed : 217
% 6.46/3.01 # ...remaining for further processing : 1080
% 6.46/3.01 # Other redundant clauses eliminated : 68
% 6.46/3.01 # Clauses deleted for lack of memory : 0
% 6.46/3.01 # Backward-subsumed : 18
% 6.46/3.01 # Backward-rewritten : 20
% 6.46/3.01 # Generated clauses : 11859
% 6.46/3.01 # ...of the previous two non-redundant : 11002
% 6.46/3.01 # ...aggressively subsumed : 0
% 6.46/3.01 # Contextual simplify-reflections : 19
% 6.46/3.01 # Paramodulations : 11742
% 6.46/3.01 # Factorizations : 12
% 6.46/3.01 # NegExts : 0
% 6.46/3.01 # Equation resolutions : 106
% 6.46/3.01 # Total rewrite steps : 1886
% 6.46/3.01 # Propositional unsat checks : 0
% 6.46/3.01 # Propositional check models : 0
% 6.46/3.01 # Propositional check unsatisfiable : 0
% 6.46/3.01 # Propositional clauses : 0
% 6.46/3.01 # Propositional clauses after purity: 0
% 6.46/3.01 # Propositional unsat core size : 0
% 6.46/3.01 # Propositional preprocessing time : 0.000
% 6.46/3.01 # Propositional encoding time : 0.000
% 6.46/3.01 # Propositional solver time : 0.000
% 6.46/3.01 # Success case prop preproc time : 0.000
% 6.46/3.01 # Success case prop encoding time : 0.000
% 6.46/3.01 # Success case prop solver time : 0.000
% 6.46/3.01 # Current number of processed clauses : 1025
% 6.46/3.01 # Positive orientable unit clauses : 120
% 6.46/3.01 # Positive unorientable unit clauses: 2
% 6.46/3.01 # Negative unit clauses : 27
% 6.46/3.01 # Non-unit-clauses : 876
% 6.46/3.01 # Current number of unprocessed clauses: 10572
% 6.46/3.01 # ...number of literals in the above : 49626
% 6.46/3.01 # Current number of archived formulas : 0
% 6.46/3.01 # Current number of archived clauses : 41
% 6.46/3.01 # Clause-clause subsumption calls (NU) : 264690
% 6.46/3.01 # Rec. Clause-clause subsumption calls : 45490
% 6.46/3.01 # Non-unit clause-clause subsumptions : 166
% 6.46/3.01 # Unit Clause-clause subsumption calls : 18158
% 6.46/3.01 # Rewrite failures with RHS unbound : 0
% 6.46/3.01 # BW rewrite match attempts : 223
% 6.46/3.01 # BW rewrite match successes : 48
% 6.46/3.01 # Condensation attempts : 0
% 6.46/3.01 # Condensation successes : 0
% 6.46/3.01 # Termbank termtop insertions : 800517
% 6.46/3.01
% 6.46/3.01 # -------------------------------------------------
% 6.46/3.01 # User time : 0.628 s
% 6.46/3.01 # System time : 0.083 s
% 6.46/3.01 # Total time : 0.711 s
% 6.46/3.01 # Maximum resident set size: 38712 pages
% 6.46/3.01
% 6.46/3.01 # -------------------------------------------------
% 6.46/3.01 # User time : 1.189 s
% 6.46/3.01 # System time : 0.108 s
% 6.46/3.01 # Total time : 1.297 s
% 6.46/3.01 # Maximum resident set size: 29716 pages
% 6.46/3.01 % E---3.1 exiting
%------------------------------------------------------------------------------