TSTP Solution File: SEU132+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU132+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:29 EDT 2023
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 5 unt; 0 def)
% Number of atoms : 90 ( 11 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 97 ( 37 ~; 42 |; 10 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 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 : 77 ( 6 sgn; 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_xboole_1,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_difference(X1,X3),set_difference(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.FGFWLVW7yu/E---3.1_28268.p',t33_xboole_1) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FGFWLVW7yu/E---3.1_28268.p',d4_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FGFWLVW7yu/E---3.1_28268.p',d3_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_difference(X1,X3),set_difference(X2,X3)) ),
inference(assume_negation,[status(cth)],[t33_xboole_1]) ).
fof(c_0_4,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_5,plain,
! [X7,X8,X9,X10,X11] :
( ( ~ subset(X7,X8)
| ~ in(X9,X7)
| in(X9,X8) )
& ( in(esk1_2(X10,X11),X10)
| subset(X10,X11) )
& ( ~ in(esk1_2(X10,X11),X11)
| subset(X10,X11) ) ),
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_6,negated_conjecture,
( subset(esk5_0,esk6_0)
& ~ subset(set_difference(esk5_0,esk7_0),set_difference(esk6_0,esk7_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_7,plain,
! [X13,X14,X15,X16,X17,X18,X19,X20] :
( ( in(X16,X13)
| ~ in(X16,X15)
| X15 != set_difference(X13,X14) )
& ( ~ in(X16,X14)
| ~ in(X16,X15)
| X15 != set_difference(X13,X14) )
& ( ~ in(X17,X13)
| in(X17,X14)
| in(X17,X15)
| X15 != set_difference(X13,X14) )
& ( ~ in(esk2_3(X18,X19,X20),X20)
| ~ in(esk2_3(X18,X19,X20),X18)
| in(esk2_3(X18,X19,X20),X19)
| X20 = set_difference(X18,X19) )
& ( in(esk2_3(X18,X19,X20),X18)
| in(esk2_3(X18,X19,X20),X20)
| X20 = set_difference(X18,X19) )
& ( ~ in(esk2_3(X18,X19,X20),X19)
| in(esk2_3(X18,X19,X20),X20)
| X20 = set_difference(X18,X19) ) ),
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)],[c_0_4])])])])])]) ).
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(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( in(X1,esk6_0)
| ~ in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( subset(X1,esk6_0)
| ~ in(esk1_2(X1,esk6_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( subset(set_difference(X1,X2),X3)
| in(esk1_2(set_difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
subset(set_difference(esk5_0,X1),esk6_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( in(X1,esk6_0)
| ~ in(X1,set_difference(esk5_0,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_22,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( subset(X1,set_difference(X2,X3))
| in(esk1_2(X1,set_difference(X2,X3)),X3)
| ~ in(esk1_2(X1,set_difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( subset(set_difference(esk5_0,X1),X2)
| in(esk1_2(set_difference(esk5_0,X1),X2),esk6_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_25,plain,
( subset(set_difference(X1,X2),X3)
| ~ in(esk1_2(set_difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( subset(set_difference(esk5_0,X1),set_difference(esk6_0,X2))
| in(esk1_2(set_difference(esk5_0,X1),set_difference(esk6_0,X2)),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ subset(set_difference(esk5_0,esk7_0),set_difference(esk6_0,esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
subset(set_difference(esk5_0,X1),set_difference(esk6_0,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : SEU132+1 : TPTP v8.1.2. Released v3.3.0.
% 0.04/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 08:08:15 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.45 Running first-order model finding
% 0.19/0.45 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.FGFWLVW7yu/E---3.1_28268.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28388 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FGHSS-FFSS32-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.50 # Starting sh5l with 136s (1) cores
% 0.19/0.50 # SAT001_MinMin_p005000_rr_RG with pid 28394 completed with status 0
% 0.19/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FGHSS-FFSS32-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 15
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 23
% 0.19/0.50 # Removed in clause preprocessing : 2
% 0.19/0.50 # Initial clauses in saturation : 21
% 0.19/0.50 # Processed clauses : 837
% 0.19/0.50 # ...of these trivial : 1
% 0.19/0.50 # ...subsumed : 575
% 0.19/0.50 # ...remaining for further processing : 261
% 0.19/0.50 # Other redundant clauses eliminated : 3
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 10
% 0.19/0.50 # Backward-rewritten : 6
% 0.19/0.50 # Generated clauses : 2899
% 0.19/0.50 # ...of the previous two non-redundant : 2173
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 2
% 0.19/0.50 # Paramodulations : 2884
% 0.19/0.50 # Factorizations : 12
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 3
% 0.19/0.50 # Total rewrite steps : 1892
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 221
% 0.19/0.50 # Positive orientable unit clauses : 30
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 7
% 0.19/0.50 # Non-unit-clauses : 184
% 0.19/0.50 # Current number of unprocessed clauses: 1354
% 0.19/0.50 # ...number of literals in the above : 4123
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 37
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 5963
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 4376
% 0.19/0.50 # Non-unit clause-clause subsumptions : 337
% 0.19/0.50 # Unit Clause-clause subsumption calls : 275
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 61
% 0.19/0.50 # BW rewrite match successes : 5
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 40363
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.035 s
% 0.19/0.50 # System time : 0.004 s
% 0.19/0.50 # Total time : 0.039 s
% 0.19/0.50 # Maximum resident set size: 1756 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.173 s
% 0.19/0.50 # System time : 0.010 s
% 0.19/0.50 # Total time : 0.183 s
% 0.19/0.50 # Maximum resident set size: 1680 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------