TSTP Solution File: SET947+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET947+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:27 EDT 2023
% Result : Theorem 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 50 ( 6 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 51 ( 20 ~; 21 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn; 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.2Im3jrBncn/E---3.1_14757.p',d1_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.2Im3jrBncn/E---3.1_14757.p',d3_tarski) ).
fof(l50_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.2Im3jrBncn/E---3.1_14757.p',l50_zfmisc_1) ).
fof(t100_zfmisc_1,conjecture,
! [X1] : subset(X1,powerset(union(X1))),
file('/export/starexec/sandbox/tmp/tmp.2Im3jrBncn/E---3.1_14757.p',t100_zfmisc_1) ).
fof(c_0_4,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( ~ in(X8,X7)
| subset(X8,X6)
| X7 != powerset(X6) )
& ( ~ subset(X9,X6)
| in(X9,X7)
| X7 != powerset(X6) )
& ( ~ in(esk1_2(X10,X11),X11)
| ~ subset(esk1_2(X10,X11),X10)
| X11 = powerset(X10) )
& ( in(esk1_2(X10,X11),X11)
| subset(esk1_2(X10,X11),X10)
| X11 = powerset(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_zfmisc_1])])])])])]) ).
fof(c_0_5,plain,
! [X13,X14,X15,X16,X17] :
( ( ~ subset(X13,X14)
| ~ in(X15,X13)
| in(X15,X14) )
& ( in(esk2_2(X16,X17),X16)
| subset(X16,X17) )
& ( ~ in(esk2_2(X16,X17),X17)
| subset(X16,X17) ) ),
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])])])])])]) ).
cnf(c_0_6,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| X3 != powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X19,X20] :
( ~ in(X19,X20)
| subset(X19,union(X20)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l50_zfmisc_1])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] : subset(X1,powerset(union(X1))),
inference(assume_negation,[status(cth)],[t100_zfmisc_1]) ).
cnf(c_0_11,plain,
( subset(X1,powerset(X2))
| ~ subset(esk2_2(X1,powerset(X2)),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ subset(esk5_0,powerset(union(esk5_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_14,plain,
( subset(X1,powerset(union(X2)))
| ~ in(esk2_2(X1,powerset(union(X2))),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( in(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ subset(esk5_0,powerset(union(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
subset(X1,powerset(union(X1))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET947+1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n024.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 17:36:26 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.14/0.43 Running first-order model finding
% 0.14/0.43 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.2Im3jrBncn/E---3.1_14757.p
% 0.14/0.44 # Version: 3.1pre001
% 0.14/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 # Starting sh5l with 300s (1) cores
% 0.14/0.44 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 14835 completed with status 0
% 0.14/0.44 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.44 # No SInE strategy applied
% 0.14/0.44 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.44 # Starting sh5l with 136s (1) cores
% 0.14/0.44 # SAT001_MinMin_p005000_rr_RG with pid 14840 completed with status 0
% 0.14/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.44 # No SInE strategy applied
% 0.14/0.44 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.14/0.44 # Preprocessing time : 0.001 s
% 0.14/0.44 # Presaturation interreduction done
% 0.14/0.44
% 0.14/0.44 # Proof found!
% 0.14/0.44 # SZS status Theorem
% 0.14/0.44 # SZS output start CNFRefutation
% See solution above
% 0.14/0.44 # Parsed axioms : 8
% 0.14/0.44 # Removed by relevancy pruning/SinE : 0
% 0.14/0.44 # Initial clauses : 13
% 0.14/0.44 # Removed in clause preprocessing : 0
% 0.14/0.44 # Initial clauses in saturation : 13
% 0.14/0.44 # Processed clauses : 73
% 0.14/0.44 # ...of these trivial : 0
% 0.14/0.44 # ...subsumed : 3
% 0.14/0.44 # ...remaining for further processing : 70
% 0.14/0.44 # Other redundant clauses eliminated : 2
% 0.14/0.44 # Clauses deleted for lack of memory : 0
% 0.14/0.44 # Backward-subsumed : 0
% 0.14/0.44 # Backward-rewritten : 1
% 0.14/0.44 # Generated clauses : 71
% 0.14/0.44 # ...of the previous two non-redundant : 59
% 0.14/0.44 # ...aggressively subsumed : 0
% 0.14/0.44 # Contextual simplify-reflections : 0
% 0.14/0.44 # Paramodulations : 69
% 0.14/0.44 # Factorizations : 0
% 0.14/0.44 # NegExts : 0
% 0.14/0.44 # Equation resolutions : 2
% 0.14/0.44 # Total rewrite steps : 3
% 0.14/0.44 # Propositional unsat checks : 0
% 0.14/0.44 # Propositional check models : 0
% 0.14/0.44 # Propositional check unsatisfiable : 0
% 0.14/0.44 # Propositional clauses : 0
% 0.14/0.44 # Propositional clauses after purity: 0
% 0.14/0.44 # Propositional unsat core size : 0
% 0.14/0.44 # Propositional preprocessing time : 0.000
% 0.14/0.44 # Propositional encoding time : 0.000
% 0.14/0.44 # Propositional solver time : 0.000
% 0.14/0.44 # Success case prop preproc time : 0.000
% 0.14/0.44 # Success case prop encoding time : 0.000
% 0.14/0.44 # Success case prop solver time : 0.000
% 0.14/0.44 # Current number of processed clauses : 54
% 0.14/0.44 # Positive orientable unit clauses : 3
% 0.14/0.44 # Positive unorientable unit clauses: 0
% 0.14/0.44 # Negative unit clauses : 25
% 0.14/0.44 # Non-unit-clauses : 26
% 0.14/0.44 # Current number of unprocessed clauses: 12
% 0.14/0.44 # ...number of literals in the above : 30
% 0.14/0.44 # Current number of archived formulas : 0
% 0.14/0.44 # Current number of archived clauses : 14
% 0.14/0.44 # Clause-clause subsumption calls (NU) : 101
% 0.14/0.44 # Rec. Clause-clause subsumption calls : 92
% 0.14/0.44 # Non-unit clause-clause subsumptions : 0
% 0.14/0.44 # Unit Clause-clause subsumption calls : 26
% 0.14/0.44 # Rewrite failures with RHS unbound : 0
% 0.14/0.44 # BW rewrite match attempts : 4
% 0.14/0.44 # BW rewrite match successes : 1
% 0.14/0.44 # Condensation attempts : 0
% 0.14/0.44 # Condensation successes : 0
% 0.14/0.44 # Termbank termtop insertions : 2311
% 0.14/0.44
% 0.14/0.44 # -------------------------------------------------
% 0.14/0.44 # User time : 0.003 s
% 0.14/0.44 # System time : 0.003 s
% 0.14/0.44 # Total time : 0.006 s
% 0.14/0.44 # Maximum resident set size: 1736 pages
% 0.14/0.44
% 0.14/0.44 # -------------------------------------------------
% 0.14/0.44 # User time : 0.018 s
% 0.14/0.44 # System time : 0.007 s
% 0.14/0.44 # Total time : 0.025 s
% 0.14/0.44 # Maximum resident set size: 1680 pages
% 0.14/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------