TSTP Solution File: SET941+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET941+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Tue May 21 03:00:29 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 2 unt; 0 def)
% Number of atoms : 74 ( 11 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 87 ( 33 ~; 37 |; 9 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 50 ( 0 sgn 26 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t94_zfmisc_1,conjecture,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> subset(X3,X2) )
=> subset(union(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t94_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> subset(X3,X2) )
=> subset(union(X1),X2) ),
inference(assume_negation,[status(cth)],[t94_zfmisc_1]) ).
fof(c_0_4,plain,
! [X7,X8,X9,X10,X11] :
( ( ~ subset(X7,X8)
| ~ in(X9,X7)
| in(X9,X8) )
& ( in(esk1_2(X10,X11),X10)
| subset(X10,X11) )
& ( ~ in(esk1_2(X10,X11),X11)
| subset(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X29] :
( ( ~ in(X29,esk7_0)
| subset(X29,esk8_0) )
& ~ subset(union(esk7_0),esk8_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( subset(X1,esk8_0)
| ~ in(X1,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X13,X14,X15,X17,X18,X19,X20,X22] :
( ( in(X15,esk2_3(X13,X14,X15))
| ~ in(X15,X14)
| X14 != union(X13) )
& ( in(esk2_3(X13,X14,X15),X13)
| ~ in(X15,X14)
| X14 != union(X13) )
& ( ~ in(X17,X18)
| ~ in(X18,X13)
| in(X17,X14)
| X14 != union(X13) )
& ( ~ in(esk3_2(X19,X20),X20)
| ~ in(esk3_2(X19,X20),X22)
| ~ in(X22,X19)
| X20 = union(X19) )
& ( in(esk3_2(X19,X20),esk4_2(X19,X20))
| in(esk3_2(X19,X20),X20)
| X20 = union(X19) )
& ( in(esk4_2(X19,X20),X19)
| in(esk3_2(X19,X20),X20)
| X20 = union(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[d4_tarski])])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( in(X1,esk8_0)
| ~ in(X2,esk7_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( in(esk2_3(X1,X2,X3),X1)
| ~ in(X3,X2)
| X2 != union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( in(X1,esk8_0)
| X2 != union(esk7_0)
| ~ in(X1,esk2_3(esk7_0,X2,X3))
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( in(X1,esk2_3(X2,X3,X1))
| ~ in(X1,X3)
| X3 != union(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( in(X1,esk8_0)
| X2 != union(esk7_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( in(X1,esk8_0)
| ~ in(X1,union(esk7_0)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_15,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( subset(union(esk7_0),X1)
| in(esk1_2(union(esk7_0),X1),esk8_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
~ subset(union(esk7_0),esk8_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET941+1 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 11:16:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 20218 completed with status 0
% 0.19/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.48 # Starting sh5l with 136s (1) cores
% 0.19/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 20223 completed with status 0
% 0.19/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.48 # Preprocessing time : 0.002 s
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 7
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 15
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 15
% 0.19/0.48 # Processed clauses : 43
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 2
% 0.19/0.48 # ...remaining for further processing : 41
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 77
% 0.19/0.48 # ...of the previous two non-redundant : 71
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 70
% 0.19/0.49 # Factorizations : 6
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 1
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 1
% 0.19/0.49 # ...of those cached : 0
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 41
% 0.19/0.49 # Positive orientable unit clauses : 2
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 3
% 0.19/0.49 # Non-unit-clauses : 36
% 0.19/0.49 # Current number of unprocessed clauses: 40
% 0.19/0.49 # ...number of literals in the above : 184
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 0
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 237
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 148
% 0.19/0.49 # Non-unit clause-clause subsumptions : 2
% 0.19/0.49 # Unit Clause-clause subsumption calls : 1
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 1
% 0.19/0.49 # BW rewrite match successes : 0
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 2152
% 0.19/0.49 # Search garbage collected termcells : 328
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.007 s
% 0.19/0.49 # System time : 0.004 s
% 0.19/0.49 # Total time : 0.011 s
% 0.19/0.49 # Maximum resident set size: 1724 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.030 s
% 0.19/0.49 # System time : 0.011 s
% 0.19/0.49 # Total time : 0.041 s
% 0.19/0.49 # Maximum resident set size: 1688 pages
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------