TSTP Solution File: SET923+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET923+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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:24:43 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 35 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 39 ( 18 ~; 10 |; 9 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t66_zfmisc_1,conjecture,
! [X1,X2] :
~ ( set_difference(X1,singleton(X2)) = empty_set
& X1 != empty_set
& X1 != singleton(X2) ),
file('/export/starexec/sandbox/tmp/tmp.KD3PSQcGi8/E---3.1_26790.p',t66_zfmisc_1) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.KD3PSQcGi8/E---3.1_26790.p',t37_xboole_1) ).
fof(l4_zfmisc_1,axiom,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.KD3PSQcGi8/E---3.1_26790.p',l4_zfmisc_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
~ ( set_difference(X1,singleton(X2)) = empty_set
& X1 != empty_set
& X1 != singleton(X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t66_zfmisc_1])]) ).
fof(c_0_4,plain,
! [X8,X9] :
( ( set_difference(X8,X9) != empty_set
| subset(X8,X9) )
& ( ~ subset(X8,X9)
| set_difference(X8,X9) = empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])])]) ).
fof(c_0_5,negated_conjecture,
( set_difference(esk3_0,singleton(esk4_0)) = empty_set
& esk3_0 != empty_set
& esk3_0 != singleton(esk4_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ( ~ subset(X3,singleton(X4))
| X3 = empty_set
| X3 = singleton(X4) )
& ( X3 != empty_set
| subset(X3,singleton(X4)) )
& ( X3 != singleton(X4)
| subset(X3,singleton(X4)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l4_zfmisc_1])])])]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
set_difference(esk3_0,singleton(esk4_0)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X1 = empty_set
| X1 = singleton(X2)
| ~ subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
subset(esk3_0,singleton(esk4_0)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
esk3_0 != singleton(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
esk3_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SET923+1 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri May 3 10:32:09 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.KD3PSQcGi8/E---3.1_26790.p
% 0.14/0.40 # Version: 3.1.0
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 # Starting sh5l with 300s (1) cores
% 0.14/0.40 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 26867 completed with status 0
% 0.14/0.40 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # No SInE strategy applied
% 0.14/0.40 # Search class: FGUSF-FFSS21-SFFFFFNN
% 0.14/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.40 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.40 # Starting sh5l with 136s (1) cores
% 0.14/0.40 # SAT001_MinMin_p005000_rr_RG with pid 26871 completed with status 0
% 0.14/0.40 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # No SInE strategy applied
% 0.14/0.40 # Search class: FGUSF-FFSS21-SFFFFFNN
% 0.14/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Theorem
% 0.14/0.40 # SZS output start CNFRefutation
% See solution above
% 0.14/0.40 # Parsed axioms : 7
% 0.14/0.40 # Removed by relevancy pruning/SinE : 0
% 0.14/0.40 # Initial clauses : 12
% 0.14/0.40 # Removed in clause preprocessing : 0
% 0.14/0.40 # Initial clauses in saturation : 12
% 0.14/0.40 # Processed clauses : 25
% 0.14/0.40 # ...of these trivial : 0
% 0.14/0.40 # ...subsumed : 0
% 0.14/0.40 # ...remaining for further processing : 25
% 0.14/0.40 # Other redundant clauses eliminated : 2
% 0.14/0.40 # Clauses deleted for lack of memory : 0
% 0.14/0.40 # Backward-subsumed : 0
% 0.14/0.40 # Backward-rewritten : 0
% 0.14/0.40 # Generated clauses : 5
% 0.14/0.40 # ...of the previous two non-redundant : 2
% 0.14/0.40 # ...aggressively subsumed : 0
% 0.14/0.40 # Contextual simplify-reflections : 0
% 0.14/0.40 # Paramodulations : 3
% 0.14/0.40 # Factorizations : 0
% 0.14/0.40 # NegExts : 0
% 0.14/0.40 # Equation resolutions : 2
% 0.14/0.40 # Disequality decompositions : 0
% 0.14/0.40 # Total rewrite steps : 1
% 0.14/0.40 # ...of those cached : 0
% 0.14/0.40 # Propositional unsat checks : 0
% 0.14/0.40 # Propositional check models : 0
% 0.14/0.40 # Propositional check unsatisfiable : 0
% 0.14/0.40 # Propositional clauses : 0
% 0.14/0.40 # Propositional clauses after purity: 0
% 0.14/0.40 # Propositional unsat core size : 0
% 0.14/0.40 # Propositional preprocessing time : 0.000
% 0.14/0.40 # Propositional encoding time : 0.000
% 0.14/0.40 # Propositional solver time : 0.000
% 0.14/0.40 # Success case prop preproc time : 0.000
% 0.14/0.40 # Success case prop encoding time : 0.000
% 0.14/0.40 # Success case prop solver time : 0.000
% 0.14/0.40 # Current number of processed clauses : 12
% 0.14/0.40 # Positive orientable unit clauses : 6
% 0.14/0.40 # Positive unorientable unit clauses: 0
% 0.14/0.40 # Negative unit clauses : 3
% 0.14/0.40 # Non-unit-clauses : 3
% 0.14/0.40 # Current number of unprocessed clauses: 0
% 0.14/0.40 # ...number of literals in the above : 0
% 0.14/0.40 # Current number of archived formulas : 0
% 0.14/0.40 # Current number of archived clauses : 11
% 0.14/0.40 # Clause-clause subsumption calls (NU) : 1
% 0.14/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.40 # Non-unit clause-clause subsumptions : 0
% 0.14/0.40 # Unit Clause-clause subsumption calls : 0
% 0.14/0.40 # Rewrite failures with RHS unbound : 0
% 0.14/0.40 # BW rewrite match attempts : 0
% 0.14/0.40 # BW rewrite match successes : 0
% 0.14/0.40 # Condensation attempts : 0
% 0.14/0.40 # Condensation successes : 0
% 0.14/0.40 # Termbank termtop insertions : 504
% 0.14/0.40 # Search garbage collected termcells : 90
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.005 s
% 0.14/0.40 # System time : 0.000 s
% 0.14/0.40 # Total time : 0.005 s
% 0.14/0.40 # Maximum resident set size: 1660 pages
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.012 s
% 0.14/0.40 # System time : 0.003 s
% 0.14/0.40 # Total time : 0.015 s
% 0.14/0.40 # Maximum resident set size: 1696 pages
% 0.14/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------