TSTP Solution File: SET873+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET873+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:24:16 EDT 2023
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 44 ( 24 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 38 ( 15 ~; 14 |; 4 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 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-2 aty)
% Number of variables : 36 ( 1 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l21_zfmisc_1,axiom,
! [X1,X2] :
( subset(set_union2(singleton(X1),X2),X2)
=> in(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.erHt8quUxn/E---3.1_22064.p',l21_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.erHt8quUxn/E---3.1_22064.p',commutativity_k2_xboole_0) ).
fof(t13_zfmisc_1,conjecture,
! [X1,X2] :
( set_union2(singleton(X1),singleton(X2)) = singleton(X1)
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.erHt8quUxn/E---3.1_22064.p',t13_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.erHt8quUxn/E---3.1_22064.p',d1_tarski) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.erHt8quUxn/E---3.1_22064.p',reflexivity_r1_tarski) ).
fof(c_0_5,plain,
! [X13,X14] :
( ~ subset(set_union2(singleton(X13),X14),X14)
| in(X13,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l21_zfmisc_1])]) ).
fof(c_0_6,plain,
! [X15,X16] : set_union2(X15,X16) = set_union2(X16,X15),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( set_union2(singleton(X1),singleton(X2)) = singleton(X1)
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t13_zfmisc_1]) ).
fof(c_0_8,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( ~ in(X8,X7)
| X8 = X6
| X7 != singleton(X6) )
& ( X9 != X6
| in(X9,X7)
| X7 != singleton(X6) )
& ( ~ in(esk3_2(X10,X11),X11)
| esk3_2(X10,X11) != X10
| X11 = singleton(X10) )
& ( in(esk3_2(X10,X11),X11)
| esk3_2(X10,X11) = X10
| X11 = singleton(X10) ) ),
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_9,plain,
( in(X1,X2)
| ~ subset(set_union2(singleton(X1),X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( set_union2(singleton(esk1_0),singleton(esk2_0)) = singleton(esk1_0)
& esk1_0 != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_12,plain,
! [X24] : subset(X24,X24),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_13,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( in(X1,X2)
| ~ subset(set_union2(X2,singleton(X1)),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
set_union2(singleton(esk1_0),singleton(esk2_0)) = singleton(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
in(esk2_0,singleton(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET873+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 16:47:06 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.21/0.52 Running first-order model finding
% 0.21/0.52 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.erHt8quUxn/E---3.1_22064.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_1 with pid 22144 completed with status 0
% 0.21/0.53 # Result found by new_bool_1
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSS-FFSF21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # SAT001_MinMin_p005000_rr_RG with pid 22148 completed with status 0
% 0.21/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSS-FFSF21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 11
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 15
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 15
% 0.21/0.53 # Processed clauses : 42
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 4
% 0.21/0.53 # ...remaining for further processing : 38
% 0.21/0.53 # Other redundant clauses eliminated : 3
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 0
% 0.21/0.53 # Generated clauses : 26
% 0.21/0.53 # ...of the previous two non-redundant : 17
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 24
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 3
% 0.21/0.53 # Total rewrite steps : 7
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 21
% 0.21/0.53 # Positive orientable unit clauses : 6
% 0.21/0.53 # Positive unorientable unit clauses: 1
% 0.21/0.53 # Negative unit clauses : 3
% 0.21/0.53 # Non-unit-clauses : 11
% 0.21/0.53 # Current number of unprocessed clauses: 4
% 0.21/0.53 # ...number of literals in the above : 9
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 15
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 15
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 14
% 0.21/0.53 # Non-unit clause-clause subsumptions : 4
% 0.21/0.53 # Unit Clause-clause subsumption calls : 1
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 10
% 0.21/0.53 # BW rewrite match successes : 8
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 919
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.005 s
% 0.21/0.53 # System time : 0.000 s
% 0.21/0.53 # Total time : 0.006 s
% 0.21/0.53 # Maximum resident set size: 1732 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.005 s
% 0.21/0.53 # System time : 0.003 s
% 0.21/0.53 # Total time : 0.009 s
% 0.21/0.53 # Maximum resident set size: 1676 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------