TSTP Solution File: SET908+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET908+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:21:16 EDT 2023
% Result : Timeout 408.19s 300.11s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 12 unt; 0 def)
% Number of atoms : 69 ( 33 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 78 ( 32 ~; 31 |; 9 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 53 ( 5 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t49_zfmisc_1,conjecture,
! [X1,X2] : set_union2(singleton(X1),X2) != empty_set,
file('/export/starexec/sandbox2/tmp/tmp.H6E2ykYrad/E---3.1_19575.p',t49_zfmisc_1) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.H6E2ykYrad/E---3.1_19575.p',d1_xboole_0) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.H6E2ykYrad/E---3.1_19575.p',d2_xboole_0) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.H6E2ykYrad/E---3.1_19575.p',commutativity_k2_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.H6E2ykYrad/E---3.1_19575.p',d1_tarski) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] : set_union2(singleton(X1),X2) != empty_set,
inference(assume_negation,[status(cth)],[t49_zfmisc_1]) ).
fof(c_0_6,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_7,plain,
! [X13,X14,X15,X16,X17,X18,X19,X20] :
( ( ~ in(X16,X15)
| in(X16,X13)
| in(X16,X14)
| X15 != set_union2(X13,X14) )
& ( ~ in(X17,X13)
| in(X17,X15)
| X15 != set_union2(X13,X14) )
& ( ~ in(X17,X14)
| in(X17,X15)
| X15 != set_union2(X13,X14) )
& ( ~ in(esk4_3(X18,X19,X20),X18)
| ~ in(esk4_3(X18,X19,X20),X20)
| X20 = set_union2(X18,X19) )
& ( ~ in(esk4_3(X18,X19,X20),X19)
| ~ in(esk4_3(X18,X19,X20),X20)
| X20 = set_union2(X18,X19) )
& ( in(esk4_3(X18,X19,X20),X20)
| in(esk4_3(X18,X19,X20),X18)
| in(esk4_3(X18,X19,X20),X19)
| X20 = set_union2(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)],[d2_xboole_0])])])])])]) ).
fof(c_0_8,negated_conjecture,
set_union2(singleton(esk1_0),esk2_0) = empty_set,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X11,X12] : set_union2(X11,X12) = set_union2(X12,X11),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_10,plain,
! [X7,X8,X9] :
( ( X7 != empty_set
| ~ in(X8,X7) )
& ( in(esk3_1(X9),X9)
| X9 = empty_set ) ),
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_6])])])])]) ).
cnf(c_0_11,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
set_union2(singleton(esk1_0),esk2_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X27,X28,X29,X30,X31,X32] :
( ( ~ in(X29,X28)
| X29 = X27
| X28 != singleton(X27) )
& ( X30 != X27
| in(X30,X28)
| X28 != singleton(X27) )
& ( ~ in(esk5_2(X31,X32),X32)
| esk5_2(X31,X32) != X31
| X32 = singleton(X31) )
& ( in(esk5_2(X31,X32),X32)
| esk5_2(X31,X32) = X31
| X32 = singleton(X31) ) ),
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)],[d1_tarski])])])])])]) ).
cnf(c_0_16,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
set_union2(esk2_0,singleton(esk1_0)) = empty_set,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ in(X1,singleton(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SET908+1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.15 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n032.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 2400
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Mon Oct 2 17:25:34 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.H6E2ykYrad/E---3.1_19575.p
% 408.19/300.11 # Version: 3.1pre001
% 408.19/300.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.19/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/300.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.19/300.11 # Starting new_bool_3 with 300s (1) cores
% 408.19/300.11 # Starting new_bool_1 with 300s (1) cores
% 408.19/300.11 # Starting sh5l with 300s (1) cores
% 408.19/300.11 # sh5l with pid 19661 completed with status 0
% 408.19/300.11 # Result found by sh5l
% 408.19/300.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.19/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/300.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.19/300.11 # Starting new_bool_3 with 300s (1) cores
% 408.19/300.11 # Starting new_bool_1 with 300s (1) cores
% 408.19/300.11 # Starting sh5l with 300s (1) cores
% 408.19/300.11 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.19/300.11 # Search class: FGHSS-FFSS31-SFFFFFNN
% 408.19/300.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.19/300.11 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.19/300.11 # SAT001_MinMin_p005000_rr_RG with pid 19668 completed with status 0
% 408.19/300.11 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.19/300.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.19/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/300.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.19/300.11 # Starting new_bool_3 with 300s (1) cores
% 408.19/300.11 # Starting new_bool_1 with 300s (1) cores
% 408.19/300.11 # Starting sh5l with 300s (1) cores
% 408.19/300.11 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.19/300.11 # Search class: FGHSS-FFSS31-SFFFFFNN
% 408.19/300.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.19/300.11 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.19/300.11 # Preprocessing time : 0.001 s
% 408.19/300.11 # Presaturation interreduction done
% 408.19/300.11
% 408.19/300.11 # Proof found!
% 408.19/300.11 # SZS status Theorem
% 408.19/300.11 # SZS output start CNFRefutation
% See solution above
% 408.19/300.11 # Parsed axioms : 12
% 408.19/300.11 # Removed by relevancy pruning/SinE : 0
% 408.19/300.11 # Initial clauses : 21
% 408.19/300.11 # Removed in clause preprocessing : 0
% 408.19/300.11 # Initial clauses in saturation : 21
% 408.19/300.11 # Processed clauses : 45
% 408.19/300.11 # ...of these trivial : 0
% 408.19/300.11 # ...subsumed : 0
% 408.19/300.11 # ...remaining for further processing : 45
% 408.19/300.11 # Other redundant clauses eliminated : 7
% 408.19/300.11 # Clauses deleted for lack of memory : 0
% 408.19/300.11 # Backward-subsumed : 0
% 408.19/300.11 # Backward-rewritten : 1
% 408.19/300.11 # Generated clauses : 27
% 408.19/300.11 # ...of the previous two non-redundant : 22
% 408.19/300.11 # ...aggressively subsumed : 0
% 408.19/300.11 # Contextual simplify-reflections : 0
% 408.19/300.11 # Paramodulations : 21
% 408.19/300.11 # Factorizations : 0
% 408.19/300.11 # NegExts : 0
% 408.19/300.11 # Equation resolutions : 7
% 408.19/300.11 # Total rewrite steps : 5
% 408.19/300.11 # Propositional unsat checks : 0
% 408.19/300.11 # Propositional check models : 0
% 408.19/300.11 # Propositional check unsatisfiable : 0
% 408.19/300.11 # Propositional clauses : 0
% 408.19/300.11 # Propositional clauses after purity: 0
% 408.19/300.11 # Propositional unsat core size : 0
% 408.19/300.11 # Propositional preprocessing time : 0.000
% 408.19/300.11 # Propositional encoding time : 0.000
% 408.19/300.11 # Propositional solver time : 0.000
% 408.19/300.11 # Success case prop preproc time : 0.000
% 408.19/300.11 # Success case prop encoding time : 0.000
% 408.19/300.11 # Success case prop solver time : 0.000
% 408.19/300.11 # Current number of processed clauses : 17
% 408.19/300.11 # Positive orientable unit clauses : 5
% 408.19/300.11 # Positive unorientable unit clauses: 1
% 408.19/300.11 # Negative unit clauses : 4
% 408.19/300.11 # Non-unit-clauses : 7
% 408.19/300.11 # Current number of unprocessed clauses: 18
% 408.19/300.11 # ...number of literals in the above : 40
% 408.19/300.11 # Current number of archived formulas : 0
% 408.19/300.11 # Current number of archived clauses : 22
% 408.19/300.11 # Clause-clause subsumption calls (NU) : 39
% 408.19/300.11 # Rec. Clause-clause subsumption calls : 31
% 408.19/300.11 # Non-unit clause-clause subsumptions : 0
% 408.19/300.11 # Unit Clause-clause subsumption calls : 2
% 408.19/300.11 # Rewrite failures with RHS unbound : 0
% 408.19/300.11 # BW rewrite match attempts : 10
% 408.19/300.11 # BW rewrite match successes : 8
% 408.19/300.11 # Condensation attempts : 0
% 408.19/300.11 # Condensation successes : 0
% 408.19/300.11 # Termbank termtop insertions : 1288
% 408.19/300.11
% 408.19/300.11 # -------------------------------------------------
% 408.19/300.11 # User time : 0.004 s
% 408.19/300.11 # System time : 0.003 s
% 408.19/300.11 # Total time : 0.007 s
% 408.19/300.11 # Maximum resident set size: 1736 pages
% 408.19/300.11
% 408.19/300.11 # -------------------------------------------------
% 408.19/300.11 # User time : 0.004 s
% 408.19/300.11 # System time : 0.005 s
% 408.19/300.11 # Total time : 0.008 s
% 408.19/300.11 # Maximum resident set size: 1684 pages
% 408.19/300.11 % E---3.1 exiting
% 408.19/300.11 % E---3.1 exiting
%------------------------------------------------------------------------------