TSTP Solution File: SEU125+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU125+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:24:48 EDT 2023
% Result : Theorem 0.21s 0.57s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 94 ( 16 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 89 ( 31 ~; 41 |; 11 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 73 ( 4 sgn; 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_xboole_1,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.3BtO2RLY0R/E---3.1_21063.p',t8_xboole_1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3BtO2RLY0R/E---3.1_21063.p',d2_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3BtO2RLY0R/E---3.1_21063.p',d3_tarski) ).
fof(t1_boole,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
file('/export/starexec/sandbox2/tmp/tmp.3BtO2RLY0R/E---3.1_21063.p',t1_boole) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.3BtO2RLY0R/E---3.1_21063.p',commutativity_k2_xboole_0) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
inference(assume_negation,[status(cth)],[t8_xboole_1]) ).
fof(c_0_6,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( ~ in(X20,X19)
| in(X20,X17)
| in(X20,X18)
| X19 != set_union2(X17,X18) )
& ( ~ in(X21,X17)
| in(X21,X19)
| X19 != set_union2(X17,X18) )
& ( ~ in(X21,X18)
| in(X21,X19)
| X19 != set_union2(X17,X18) )
& ( ~ in(esk5_3(X22,X23,X24),X22)
| ~ in(esk5_3(X22,X23,X24),X24)
| X24 = set_union2(X22,X23) )
& ( ~ in(esk5_3(X22,X23,X24),X23)
| ~ in(esk5_3(X22,X23,X24),X24)
| X24 = set_union2(X22,X23) )
& ( in(esk5_3(X22,X23,X24),X24)
| in(esk5_3(X22,X23,X24),X22)
| in(esk5_3(X22,X23,X24),X23)
| X24 = set_union2(X22,X23) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])]) ).
fof(c_0_7,plain,
! [X8,X9,X10,X11,X12] :
( ( ~ subset(X8,X9)
| ~ in(X10,X8)
| in(X10,X9) )
& ( in(esk4_2(X11,X12),X11)
| subset(X11,X12) )
& ( ~ in(esk4_2(X11,X12),X12)
| subset(X11,X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
fof(c_0_8,negated_conjecture,
( subset(esk1_0,esk2_0)
& subset(esk3_0,esk2_0)
& ~ subset(set_union2(esk1_0,esk3_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
subset(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( in(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( subset(X1,set_union2(X2,X3))
| ~ in(esk4_2(X1,set_union2(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( subset(esk3_0,X1)
| in(esk4_2(esk3_0,X1),esk2_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
subset(esk3_0,set_union2(X1,esk2_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_19,plain,
! [X31] : set_union2(X31,empty_set) = X31,
inference(variable_rename,[status(thm)],[t1_boole]) ).
fof(c_0_20,plain,
! [X15,X16] : set_union2(X15,X16) = set_union2(X16,X15),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_21,negated_conjecture,
( in(X1,set_union2(X2,esk2_0))
| ~ in(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_22,plain,
set_union2(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X2 != set_union2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
( subset(X1,set_union2(X2,esk2_0))
| ~ in(esk4_2(X1,set_union2(X2,esk2_0)),esk3_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_26,plain,
set_union2(empty_set,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( subset(X1,esk2_0)
| ~ in(esk4_2(X1,esk2_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( subset(set_union2(X1,X2),X3)
| in(esk4_2(set_union2(X1,X2),X3),X2)
| in(esk4_2(set_union2(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_31,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( subset(set_union2(esk3_0,X1),esk2_0)
| in(esk4_2(set_union2(esk3_0,X1),esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ subset(set_union2(esk1_0,esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
in(esk4_2(set_union2(esk1_0,esk3_0),esk2_0),esk2_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23]),c_0_23]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_34]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SEU125+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 08:49:44 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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.3BtO2RLY0R/E---3.1_21063.p
% 0.21/0.57 # Version: 3.1pre001
% 0.21/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.57 # Starting sh5l with 300s (1) cores
% 0.21/0.57 # sh5l with pid 21152 completed with status 0
% 0.21/0.57 # Result found by sh5l
% 0.21/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.57 # Starting sh5l with 300s (1) cores
% 0.21/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.57 # Search class: FGHSM-FFSS32-SFFFFFNN
% 0.21/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.57 # SAT001_MinMin_p005000_rr_RG with pid 21155 completed with status 0
% 0.21/0.57 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.57 # Starting sh5l with 300s (1) cores
% 0.21/0.57 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.57 # Search class: FGHSM-FFSS32-SFFFFFNN
% 0.21/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.57 # Preprocessing time : 0.001 s
% 0.21/0.57 # Presaturation interreduction done
% 0.21/0.57
% 0.21/0.57 # Proof found!
% 0.21/0.57 # SZS status Theorem
% 0.21/0.57 # SZS output start CNFRefutation
% See solution above
% 0.21/0.57 # Parsed axioms : 18
% 0.21/0.57 # Removed by relevancy pruning/SinE : 2
% 0.21/0.57 # Initial clauses : 25
% 0.21/0.57 # Removed in clause preprocessing : 0
% 0.21/0.57 # Initial clauses in saturation : 25
% 0.21/0.57 # Processed clauses : 673
% 0.21/0.57 # ...of these trivial : 4
% 0.21/0.57 # ...subsumed : 429
% 0.21/0.57 # ...remaining for further processing : 240
% 0.21/0.57 # Other redundant clauses eliminated : 3
% 0.21/0.57 # Clauses deleted for lack of memory : 0
% 0.21/0.57 # Backward-subsumed : 10
% 0.21/0.57 # Backward-rewritten : 2
% 0.21/0.57 # Generated clauses : 1749
% 0.21/0.57 # ...of the previous two non-redundant : 1621
% 0.21/0.57 # ...aggressively subsumed : 0
% 0.21/0.57 # Contextual simplify-reflections : 0
% 0.21/0.57 # Paramodulations : 1642
% 0.21/0.57 # Factorizations : 104
% 0.21/0.57 # NegExts : 0
% 0.21/0.57 # Equation resolutions : 3
% 0.21/0.57 # Total rewrite steps : 454
% 0.21/0.57 # Propositional unsat checks : 0
% 0.21/0.57 # Propositional check models : 0
% 0.21/0.57 # Propositional check unsatisfiable : 0
% 0.21/0.57 # Propositional clauses : 0
% 0.21/0.57 # Propositional clauses after purity: 0
% 0.21/0.57 # Propositional unsat core size : 0
% 0.21/0.57 # Propositional preprocessing time : 0.000
% 0.21/0.57 # Propositional encoding time : 0.000
% 0.21/0.57 # Propositional solver time : 0.000
% 0.21/0.57 # Success case prop preproc time : 0.000
% 0.21/0.57 # Success case prop encoding time : 0.000
% 0.21/0.57 # Success case prop solver time : 0.000
% 0.21/0.57 # Current number of processed clauses : 200
% 0.21/0.57 # Positive orientable unit clauses : 17
% 0.21/0.57 # Positive unorientable unit clauses: 1
% 0.21/0.57 # Negative unit clauses : 6
% 0.21/0.57 # Non-unit-clauses : 176
% 0.21/0.57 # Current number of unprocessed clauses: 990
% 0.21/0.57 # ...number of literals in the above : 4164
% 0.21/0.57 # Current number of archived formulas : 0
% 0.21/0.57 # Current number of archived clauses : 37
% 0.21/0.57 # Clause-clause subsumption calls (NU) : 14461
% 0.21/0.57 # Rec. Clause-clause subsumption calls : 12327
% 0.21/0.57 # Non-unit clause-clause subsumptions : 406
% 0.21/0.57 # Unit Clause-clause subsumption calls : 128
% 0.21/0.57 # Rewrite failures with RHS unbound : 0
% 0.21/0.57 # BW rewrite match attempts : 44
% 0.21/0.57 # BW rewrite match successes : 22
% 0.21/0.57 # Condensation attempts : 0
% 0.21/0.57 # Condensation successes : 0
% 0.21/0.57 # Termbank termtop insertions : 24209
% 0.21/0.57
% 0.21/0.57 # -------------------------------------------------
% 0.21/0.57 # User time : 0.044 s
% 0.21/0.57 # System time : 0.001 s
% 0.21/0.57 # Total time : 0.045 s
% 0.21/0.57 # Maximum resident set size: 1720 pages
% 0.21/0.57
% 0.21/0.57 # -------------------------------------------------
% 0.21/0.57 # User time : 0.046 s
% 0.21/0.57 # System time : 0.003 s
% 0.21/0.57 # Total time : 0.049 s
% 0.21/0.57 # Maximum resident set size: 1684 pages
% 0.21/0.57 % E---3.1 exiting
% 0.21/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------