TSTP Solution File: SEU125+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n005.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:30:27 EDT 2023
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 12 unt; 0 def)
% Number of atoms : 93 ( 15 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 : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 73 ( 5 sgn; 33 !; 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/sandbox/tmp/tmp.ZCmvvkfdy4/E---3.1_6179.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/sandbox/tmp/tmp.ZCmvvkfdy4/E---3.1_6179.p',d2_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZCmvvkfdy4/E---3.1_6179.p',d3_tarski) ).
fof(idempotence_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.ZCmvvkfdy4/E---3.1_6179.p',idempotence_k2_xboole_0) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.ZCmvvkfdy4/E---3.1_6179.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,
! [X24,X25,X26,X27,X28,X29,X30,X31] :
( ( ~ in(X27,X26)
| in(X27,X24)
| in(X27,X25)
| X26 != set_union2(X24,X25) )
& ( ~ in(X28,X24)
| in(X28,X26)
| X26 != set_union2(X24,X25) )
& ( ~ in(X28,X25)
| in(X28,X26)
| X26 != set_union2(X24,X25) )
& ( ~ in(esk5_3(X29,X30,X31),X29)
| ~ in(esk5_3(X29,X30,X31),X31)
| X31 = set_union2(X29,X30) )
& ( ~ in(esk5_3(X29,X30,X31),X30)
| ~ in(esk5_3(X29,X30,X31),X31)
| X31 = set_union2(X29,X30) )
& ( in(esk5_3(X29,X30,X31),X31)
| in(esk5_3(X29,X30,X31),X29)
| in(esk5_3(X29,X30,X31),X30)
| X31 = set_union2(X29,X30) ) ),
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]) ).
cnf(c_0_19,negated_conjecture,
( in(X1,set_union2(X2,esk2_0))
| ~ in(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
fof(c_0_20,plain,
! [X21] : set_union2(X21,X21) = X21,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k2_xboole_0])]) ).
cnf(c_0_21,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_22,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_19]) ).
cnf(c_0_23,plain,
set_union2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
( subset(X1,esk2_0)
| ~ in(esk4_2(X1,esk2_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,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_24,c_0_15]) ).
fof(c_0_28,plain,
! [X15,X16] : set_union2(X15,X16) = set_union2(X16,X15),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_29,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_25]) ).
cnf(c_0_30,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_26,c_0_27]) ).
cnf(c_0_31,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ subset(set_union2(esk1_0,esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,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_29,c_0_30]),c_0_31]),c_0_31]),c_0_32]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_33]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU125+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 08:52:31 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.ZCmvvkfdy4/E---3.1_6179.p
% 0.16/0.46 # Version: 3.1pre001
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # new_bool_3 with pid 6257 completed with status 0
% 0.16/0.46 # Result found by new_bool_3
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FGHSS-FFSS32-SFFFFFNN
% 0.16/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.46 # SAT001_MinMin_p005000_rr_RG with pid 6263 completed with status 0
% 0.16/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FGHSS-FFSS32-SFFFFFNN
% 0.16/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 18
% 0.16/0.46 # Removed by relevancy pruning/SinE : 5
% 0.16/0.46 # Initial clauses : 22
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 22
% 0.16/0.46 # Processed clauses : 431
% 0.16/0.46 # ...of these trivial : 4
% 0.16/0.46 # ...subsumed : 250
% 0.16/0.46 # ...remaining for further processing : 177
% 0.16/0.46 # Other redundant clauses eliminated : 3
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 6
% 0.16/0.46 # Backward-rewritten : 0
% 0.16/0.46 # Generated clauses : 1032
% 0.16/0.46 # ...of the previous two non-redundant : 965
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 0
% 0.16/0.46 # Paramodulations : 943
% 0.16/0.46 # Factorizations : 86
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 3
% 0.16/0.46 # Total rewrite steps : 90
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 146
% 0.16/0.46 # Positive orientable unit clauses : 13
% 0.16/0.46 # Positive unorientable unit clauses: 1
% 0.16/0.46 # Negative unit clauses : 6
% 0.16/0.46 # Non-unit-clauses : 126
% 0.16/0.46 # Current number of unprocessed clauses: 572
% 0.16/0.46 # ...number of literals in the above : 1855
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 28
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 8019
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 6733
% 0.16/0.46 # Non-unit clause-clause subsumptions : 235
% 0.16/0.46 # Unit Clause-clause subsumption calls : 121
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 34
% 0.16/0.46 # BW rewrite match successes : 16
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 13934
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.027 s
% 0.16/0.46 # System time : 0.000 s
% 0.16/0.46 # Total time : 0.027 s
% 0.16/0.46 # Maximum resident set size: 1720 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.027 s
% 0.16/0.46 # System time : 0.002 s
% 0.16/0.46 # Total time : 0.030 s
% 0.16/0.46 # Maximum resident set size: 1684 pages
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------