TSTP Solution File: SEU104+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU104+1 : TPTP v8.1.2. Released v3.2.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:30:22 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 6 unt; 0 def)
% Number of atoms : 80 ( 3 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 96 ( 41 ~; 33 |; 11 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn; 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t10_finsub_1,axiom,
! [X1] :
( preboolean(X1)
<=> ! [X2,X3] :
( ( in(X2,X1)
& in(X3,X1) )
=> ( in(set_union2(X2,X3),X1)
& in(set_difference(X2,X3),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6phGstyE8r/E---3.1_14836.p',t10_finsub_1) ).
fof(t98_xboole_1,axiom,
! [X1,X2] : set_union2(X1,X2) = symmetric_difference(X1,set_difference(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.6phGstyE8r/E---3.1_14836.p',t98_xboole_1) ).
fof(t15_finsub_1,conjecture,
! [X1] :
( ~ empty(X1)
=> ( ! [X2] :
( element(X2,X1)
=> ! [X3] :
( element(X3,X1)
=> ( in(symmetric_difference(X2,X3),X1)
& in(set_difference(X2,X3),X1) ) ) )
=> preboolean(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.6phGstyE8r/E---3.1_14836.p',t15_finsub_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.6phGstyE8r/E---3.1_14836.p',t1_subset) ).
fof(c_0_4,plain,
! [X46,X47,X48,X49] :
( ( in(set_union2(X47,X48),X46)
| ~ in(X47,X46)
| ~ in(X48,X46)
| ~ preboolean(X46) )
& ( in(set_difference(X47,X48),X46)
| ~ in(X47,X46)
| ~ in(X48,X46)
| ~ preboolean(X46) )
& ( in(esk11_1(X49),X49)
| preboolean(X49) )
& ( in(esk12_1(X49),X49)
| preboolean(X49) )
& ( ~ in(set_union2(esk11_1(X49),esk12_1(X49)),X49)
| ~ in(set_difference(esk11_1(X49),esk12_1(X49)),X49)
| preboolean(X49) ) ),
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)],[t10_finsub_1])])])])])]) ).
fof(c_0_5,plain,
! [X76,X77] : set_union2(X76,X77) = symmetric_difference(X76,set_difference(X77,X76)),
inference(variable_rename,[status(thm)],[t98_xboole_1]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ( ! [X2] :
( element(X2,X1)
=> ! [X3] :
( element(X3,X1)
=> ( in(symmetric_difference(X2,X3),X1)
& in(set_difference(X2,X3),X1) ) ) )
=> preboolean(X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t15_finsub_1])]) ).
cnf(c_0_7,plain,
( preboolean(X1)
| ~ in(set_union2(esk11_1(X1),esk12_1(X1)),X1)
| ~ in(set_difference(esk11_1(X1),esk12_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
set_union2(X1,X2) = symmetric_difference(X1,set_difference(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
! [X53,X54] :
( ~ empty(esk13_0)
& ( in(symmetric_difference(X53,X54),esk13_0)
| ~ element(X54,esk13_0)
| ~ element(X53,esk13_0) )
& ( in(set_difference(X53,X54),esk13_0)
| ~ element(X54,esk13_0)
| ~ element(X53,esk13_0) )
& ~ preboolean(esk13_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
cnf(c_0_10,plain,
( preboolean(X1)
| ~ in(set_difference(esk11_1(X1),esk12_1(X1)),X1)
| ~ in(symmetric_difference(esk11_1(X1),set_difference(esk12_1(X1),esk11_1(X1))),X1) ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( in(symmetric_difference(X1,X2),esk13_0)
| ~ element(X2,esk13_0)
| ~ element(X1,esk13_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ preboolean(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X56,X57] :
( ~ in(X56,X57)
| element(X56,X57) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_14,negated_conjecture,
( ~ element(set_difference(esk12_1(esk13_0),esk11_1(esk13_0)),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0)
| ~ in(set_difference(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ element(esk11_1(esk13_0),esk13_0)
| ~ in(set_difference(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ in(set_difference(esk12_1(esk13_0),esk11_1(esk13_0)),esk13_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( in(set_difference(X1,X2),esk13_0)
| ~ element(X2,esk13_0)
| ~ element(X1,esk13_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( ~ element(esk11_1(esk13_0),esk13_0)
| ~ element(esk12_1(esk13_0),esk13_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( ~ element(esk11_1(esk13_0),esk13_0)
| ~ in(esk12_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ in(esk12_1(esk13_0),esk13_0)
| ~ in(esk11_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_21,plain,
( in(esk12_1(X1),X1)
| preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,negated_conjecture,
~ in(esk11_1(esk13_0),esk13_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_12]) ).
cnf(c_0_23,plain,
( in(esk11_1(X1),X1)
| preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU104+1 : TPTP v8.1.2. Released v3.2.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 08:32:36 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.6phGstyE8r/E---3.1_14836.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14938 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSM-FFMM21-MFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 14947 completed with status 0
% 0.20/0.52 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSM-FFMM21-MFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.52 # Preprocessing time : 0.003 s
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 42
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 71
% 0.20/0.52 # Removed in clause preprocessing : 1
% 0.20/0.52 # Initial clauses in saturation : 70
% 0.20/0.52 # Processed clauses : 114
% 0.20/0.52 # ...of these trivial : 2
% 0.20/0.52 # ...subsumed : 11
% 0.20/0.52 # ...remaining for further processing : 101
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 1
% 0.20/0.52 # Backward-rewritten : 15
% 0.20/0.52 # Generated clauses : 160
% 0.20/0.52 # ...of the previous two non-redundant : 128
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 1
% 0.20/0.52 # Paramodulations : 160
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Total rewrite steps : 80
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 85
% 0.20/0.52 # Positive orientable unit clauses : 27
% 0.20/0.52 # Positive unorientable unit clauses: 2
% 0.20/0.52 # Negative unit clauses : 7
% 0.20/0.52 # Non-unit-clauses : 49
% 0.20/0.52 # Current number of unprocessed clauses: 78
% 0.20/0.52 # ...number of literals in the above : 205
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 17
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 465
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 426
% 0.20/0.52 # Non-unit clause-clause subsumptions : 8
% 0.20/0.52 # Unit Clause-clause subsumption calls : 36
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 33
% 0.20/0.52 # BW rewrite match successes : 24
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 4524
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.013 s
% 0.20/0.52 # System time : 0.003 s
% 0.20/0.52 # Total time : 0.016 s
% 0.20/0.52 # Maximum resident set size: 1896 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.054 s
% 0.20/0.52 # System time : 0.009 s
% 0.20/0.52 # Total time : 0.063 s
% 0.20/0.52 # Maximum resident set size: 1712 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------