TSTP Solution File: SEU128+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU128+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:30:22 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 9 unt; 0 def)
% Number of atoms : 90 ( 12 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 93 ( 35 ~; 40 |; 12 &)
% ( 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 : 67 ( 5 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t19_xboole_1,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.oWWFaaeAPy/E---3.1_9338.p',t19_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.oWWFaaeAPy/E---3.1_9338.p',d3_tarski) ).
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/sandbox/tmp/tmp.oWWFaaeAPy/E---3.1_9338.p',d3_xboole_0) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.oWWFaaeAPy/E---3.1_9338.p',idempotence_k3_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
inference(assume_negation,[status(cth)],[t19_xboole_1]) ).
fof(c_0_5,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(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])])])])])])]) ).
fof(c_0_6,negated_conjecture,
( subset(esk1_0,esk2_0)
& subset(esk1_0,esk3_0)
& ~ subset(esk1_0,set_intersection2(esk2_0,esk3_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( in(X20,X17)
| ~ in(X20,X19)
| X19 != set_intersection2(X17,X18) )
& ( in(X20,X18)
| ~ in(X20,X19)
| X19 != set_intersection2(X17,X18) )
& ( ~ in(X21,X17)
| ~ in(X21,X18)
| in(X21,X19)
| X19 != set_intersection2(X17,X18) )
& ( ~ in(esk5_3(X22,X23,X24),X24)
| ~ in(esk5_3(X22,X23,X24),X22)
| ~ in(esk5_3(X22,X23,X24),X23)
| X24 = set_intersection2(X22,X23) )
& ( in(esk5_3(X22,X23,X24),X22)
| in(esk5_3(X22,X23,X24),X24)
| X24 = set_intersection2(X22,X23) )
& ( in(esk5_3(X22,X23,X24),X23)
| in(esk5_3(X22,X23,X24),X24)
| X24 = set_intersection2(X22,X23) ) ),
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_8,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subset(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( in(X1,esk3_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( in(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( subset(X1,esk3_0)
| ~ in(esk4_2(X1,esk3_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( subset(set_intersection2(X1,X2),X3)
| in(esk4_2(set_intersection2(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
subset(set_intersection2(X1,esk1_0),esk3_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( in(X1,esk3_0)
| ~ in(X1,set_intersection2(X2,esk1_0)) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
fof(c_0_20,plain,
! [X26] : set_intersection2(X26,X26) = X26,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k3_xboole_0])]) ).
cnf(c_0_21,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( subset(set_intersection2(X1,esk1_0),X2)
| in(esk4_2(set_intersection2(X1,esk1_0),X2),esk3_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_23,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( subset(X1,set_intersection2(X2,X3))
| ~ in(esk4_2(X1,set_intersection2(X2,X3)),X3)
| ~ in(esk4_2(X1,set_intersection2(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( subset(esk1_0,X1)
| in(esk4_2(esk1_0,X1),esk3_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
( subset(esk1_0,set_intersection2(X1,esk3_0))
| ~ in(esk4_2(esk1_0,set_intersection2(X1,esk3_0)),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
~ subset(esk1_0,set_intersection2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
~ in(esk4_2(esk1_0,set_intersection2(esk2_0,esk3_0)),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_14]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU128+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n010.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 : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 07:43:03 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.oWWFaaeAPy/E---3.1_9338.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # sh5l with pid 9440 completed with status 0
% 0.20/0.51 # Result found by sh5l
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGHSM-FFSS32-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 9448 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGHSM-FFSS32-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 16
% 0.20/0.51 # Removed by relevancy pruning/SinE : 2
% 0.20/0.51 # Initial clauses : 23
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 23
% 0.20/0.51 # Processed clauses : 218
% 0.20/0.51 # ...of these trivial : 5
% 0.20/0.51 # ...subsumed : 97
% 0.20/0.51 # ...remaining for further processing : 116
% 0.20/0.51 # Other redundant clauses eliminated : 3
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 5
% 0.20/0.51 # Backward-rewritten : 1
% 0.20/0.51 # Generated clauses : 456
% 0.20/0.51 # ...of the previous two non-redundant : 386
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 1
% 0.20/0.51 # Paramodulations : 445
% 0.20/0.51 # Factorizations : 8
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 3
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 95
% 0.20/0.51 # ...of those cached : 73
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 84
% 0.20/0.51 # Positive orientable unit clauses : 16
% 0.20/0.51 # Positive unorientable unit clauses: 1
% 0.20/0.51 # Negative unit clauses : 8
% 0.20/0.51 # Non-unit-clauses : 59
% 0.20/0.51 # Current number of unprocessed clauses: 205
% 0.20/0.51 # ...number of literals in the above : 577
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 29
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 848
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 686
% 0.20/0.51 # Non-unit clause-clause subsumptions : 75
% 0.20/0.51 # Unit Clause-clause subsumption calls : 100
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 31
% 0.20/0.51 # BW rewrite match successes : 13
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 5967
% 0.20/0.51 # Search garbage collected termcells : 343
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.016 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.018 s
% 0.20/0.51 # Maximum resident set size: 1708 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.016 s
% 0.20/0.51 # System time : 0.005 s
% 0.20/0.51 # Total time : 0.021 s
% 0.20/0.51 # Maximum resident set size: 1700 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------