TSTP Solution File: SEU127+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU127+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:10 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 55 ( 11 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 56 ( 20 ~; 24 |; 8 &)
% ( 3 <=>; 1 =>; 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 : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 48 ( 4 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XxqInOttL3/E---3.1_15002.p',d3_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XxqInOttL3/E---3.1_15002.p',d3_tarski) ).
fof(t17_xboole_1,conjecture,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.XxqInOttL3/E---3.1_15002.p',t17_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.XxqInOttL3/E---3.1_15002.p',commutativity_k3_xboole_0) ).
fof(c_0_4,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23] :
( ( in(X19,X16)
| ~ in(X19,X18)
| X18 != set_intersection2(X16,X17) )
& ( in(X19,X17)
| ~ in(X19,X18)
| X18 != set_intersection2(X16,X17) )
& ( ~ in(X20,X16)
| ~ in(X20,X17)
| in(X20,X18)
| X18 != set_intersection2(X16,X17) )
& ( ~ in(esk4_3(X21,X22,X23),X23)
| ~ in(esk4_3(X21,X22,X23),X21)
| ~ in(esk4_3(X21,X22,X23),X22)
| X23 = set_intersection2(X21,X22) )
& ( in(esk4_3(X21,X22,X23),X21)
| in(esk4_3(X21,X22,X23),X23)
| X23 = set_intersection2(X21,X22) )
& ( in(esk4_3(X21,X22,X23),X22)
| in(esk4_3(X21,X22,X23),X23)
| X23 = set_intersection2(X21,X22) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_xboole_0])])])])])])]) ).
cnf(c_0_5,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X7,X8,X9,X10,X11] :
( ( ~ subset(X7,X8)
| ~ in(X9,X7)
| in(X9,X8) )
& ( in(esk3_2(X10,X11),X10)
| subset(X10,X11) )
& ( ~ in(esk3_2(X10,X11),X11)
| subset(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
cnf(c_0_7,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] : subset(set_intersection2(X1,X2),X1),
inference(assume_negation,[status(cth)],[t17_xboole_1]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( subset(set_intersection2(X1,X2),X3)
| in(esk3_2(set_intersection2(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_12,plain,
! [X14,X15] : set_intersection2(X14,X15) = set_intersection2(X15,X14),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_13,negated_conjecture,
~ subset(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_9])])])]) ).
cnf(c_0_14,plain,
subset(set_intersection2(X1,X2),X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ subset(set_intersection2(esk1_0,esk2_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
subset(set_intersection2(X1,X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU127+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n019.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Fri May 3 07:49:14 EDT 2024
% 0.15/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.XxqInOttL3/E---3.1_15002.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 15122 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHSS-FFSF32-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 15127 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHSS-FFSF32-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 16
% 0.20/0.49 # Removed by relevancy pruning/SinE : 5
% 0.20/0.49 # Initial clauses : 18
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 18
% 0.20/0.49 # Processed clauses : 93
% 0.20/0.49 # ...of these trivial : 1
% 0.20/0.49 # ...subsumed : 27
% 0.20/0.49 # ...remaining for further processing : 65
% 0.20/0.49 # Other redundant clauses eliminated : 3
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 1
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 142
% 0.20/0.49 # ...of the previous two non-redundant : 107
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 1
% 0.20/0.49 # Paramodulations : 135
% 0.20/0.49 # Factorizations : 4
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 3
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 29
% 0.20/0.49 # ...of those cached : 18
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 42
% 0.20/0.49 # Positive orientable unit clauses : 8
% 0.20/0.49 # Positive unorientable unit clauses: 1
% 0.20/0.49 # Negative unit clauses : 5
% 0.20/0.49 # Non-unit-clauses : 28
% 0.20/0.49 # Current number of unprocessed clauses: 49
% 0.20/0.49 # ...number of literals in the above : 127
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 20
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 159
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 133
% 0.20/0.49 # Non-unit clause-clause subsumptions : 21
% 0.20/0.49 # Unit Clause-clause subsumption calls : 29
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 17
% 0.20/0.49 # BW rewrite match successes : 9
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 2368
% 0.20/0.49 # Search garbage collected termcells : 317
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.010 s
% 0.20/0.49 # Maximum resident set size: 1768 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.007 s
% 0.20/0.49 # Total time : 0.013 s
% 0.20/0.49 # Maximum resident set size: 1700 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------