TSTP Solution File: SEU130+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU130+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:25:11 EDT 2024
% Result : Theorem 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 10 unt; 0 def)
% Number of atoms : 40 ( 9 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 34 ( 14 ~; 11 |; 5 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 2 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t28_xboole_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.IIGhQXPVLb/E---3.1_31285.p',t28_xboole_1) ).
fof(t19_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.IIGhQXPVLb/E---3.1_31285.p',t19_xboole_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.IIGhQXPVLb/E---3.1_31285.p',reflexivity_r1_tarski) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IIGhQXPVLb/E---3.1_31285.p',d10_xboole_0) ).
fof(t17_xboole_1,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.IIGhQXPVLb/E---3.1_31285.p',t17_xboole_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[t28_xboole_1]) ).
fof(c_0_6,lemma,
! [X23,X24,X25] :
( ~ subset(X23,X24)
| ~ subset(X23,X25)
| subset(X23,set_intersection2(X24,X25)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])])]) ).
fof(c_0_7,negated_conjecture,
( subset(esk1_0,esk2_0)
& set_intersection2(esk1_0,esk2_0) != esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_8,lemma,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X44] : subset(X44,X44),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_11,plain,
! [X36,X37] :
( ( subset(X36,X37)
| X36 != X37 )
& ( subset(X37,X36)
| X36 != X37 )
& ( ~ subset(X36,X37)
| ~ subset(X37,X36)
| X36 = X37 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_12,negated_conjecture,
( subset(esk1_0,set_intersection2(X1,esk2_0))
| ~ subset(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,lemma,
! [X21,X22] : subset(set_intersection2(X21,X22),X21),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
subset(esk1_0,set_intersection2(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,lemma,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
set_intersection2(esk1_0,esk2_0) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SEU130+2 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri May 3 07:47:58 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 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.IIGhQXPVLb/E---3.1_31285.p
% 0.17/0.48 # Version: 3.1.0
% 0.17/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # sh5l with pid 31403 completed with status 0
% 0.17/0.48 # Result found by sh5l
% 0.17/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.48 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 163s (1) cores
% 0.17/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 31410 completed with status 0
% 0.17/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.17/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.48 # Search class: FGHSM-FFMS32-SFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 163s (1) cores
% 0.17/0.48 # Preprocessing time : 0.001 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Theorem
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 38
% 0.17/0.48 # Removed by relevancy pruning/SinE : 3
% 0.17/0.48 # Initial clauses : 55
% 0.17/0.48 # Removed in clause preprocessing : 0
% 0.17/0.48 # Initial clauses in saturation : 55
% 0.17/0.48 # Processed clauses : 147
% 0.17/0.48 # ...of these trivial : 5
% 0.17/0.48 # ...subsumed : 15
% 0.17/0.48 # ...remaining for further processing : 127
% 0.17/0.48 # Other redundant clauses eliminated : 10
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 0
% 0.17/0.48 # Backward-rewritten : 1
% 0.17/0.48 # Generated clauses : 187
% 0.17/0.48 # ...of the previous two non-redundant : 128
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 0
% 0.17/0.48 # Paramodulations : 177
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 10
% 0.17/0.48 # Disequality decompositions : 0
% 0.17/0.48 # Total rewrite steps : 56
% 0.17/0.48 # ...of those cached : 32
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 64
% 0.17/0.48 # Positive orientable unit clauses : 20
% 0.17/0.48 # Positive unorientable unit clauses: 2
% 0.17/0.48 # Negative unit clauses : 3
% 0.17/0.48 # Non-unit-clauses : 39
% 0.17/0.48 # Current number of unprocessed clauses: 88
% 0.17/0.48 # ...number of literals in the above : 177
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 54
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 184
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 141
% 0.17/0.48 # Non-unit clause-clause subsumptions : 8
% 0.17/0.48 # Unit Clause-clause subsumption calls : 6
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 48
% 0.17/0.48 # BW rewrite match successes : 37
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 4751
% 0.17/0.48 # Search garbage collected termcells : 800
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.011 s
% 0.17/0.48 # System time : 0.001 s
% 0.17/0.48 # Total time : 0.012 s
% 0.17/0.48 # Maximum resident set size: 1888 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.013 s
% 0.17/0.48 # System time : 0.003 s
% 0.17/0.48 # Total time : 0.016 s
% 0.17/0.48 # Maximum resident set size: 1720 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E exiting
%------------------------------------------------------------------------------