TSTP Solution File: SET975+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET975+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:30 EDT 2023
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 65 ( 22 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 71 ( 27 ~; 29 |; 10 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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; 4 con; 0-2 aty)
% Number of variables : 46 ( 4 sgn; 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t128_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(singleton(X3),X4))
<=> ( X1 = X3
& in(X2,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.zKdiKtfD7U/E---3.1_19551.p',t128_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.zKdiKtfD7U/E---3.1_19551.p',d1_tarski) ).
fof(l55_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.zKdiKtfD7U/E---3.1_19551.p',l55_zfmisc_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(singleton(X3),X4))
<=> ( X1 = X3
& in(X2,X4) ) ),
inference(assume_negation,[status(cth)],[t128_zfmisc_1]) ).
fof(c_0_4,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ in(X13,X12)
| X13 = X11
| X12 != singleton(X11) )
& ( X14 != X11
| in(X14,X12)
| X12 != singleton(X11) )
& ( ~ in(esk5_2(X15,X16),X16)
| esk5_2(X15,X16) != X15
| X16 = singleton(X15) )
& ( in(esk5_2(X15,X16),X16)
| esk5_2(X15,X16) = X15
| X16 = singleton(X15) ) ),
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])])])])])]) ).
fof(c_0_5,plain,
! [X18,X19,X20,X21] :
( ( in(X18,X20)
| ~ in(ordered_pair(X18,X19),cartesian_product2(X20,X21)) )
& ( in(X19,X21)
| ~ in(ordered_pair(X18,X19),cartesian_product2(X20,X21)) )
& ( ~ in(X18,X20)
| ~ in(X19,X21)
| in(ordered_pair(X18,X19),cartesian_product2(X20,X21)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l55_zfmisc_1])])]) ).
fof(c_0_6,negated_conjecture,
( ( ~ in(ordered_pair(esk1_0,esk2_0),cartesian_product2(singleton(esk3_0),esk4_0))
| esk1_0 != esk3_0
| ~ in(esk2_0,esk4_0) )
& ( esk1_0 = esk3_0
| in(ordered_pair(esk1_0,esk2_0),cartesian_product2(singleton(esk3_0),esk4_0)) )
& ( in(esk2_0,esk4_0)
| in(ordered_pair(esk1_0,esk2_0),cartesian_product2(singleton(esk3_0),esk4_0)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_7,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( in(X1,X2)
| ~ in(ordered_pair(X3,X1),cartesian_product2(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( in(esk2_0,esk4_0)
| in(ordered_pair(esk1_0,esk2_0),cartesian_product2(singleton(esk3_0),esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( esk1_0 = esk3_0
| in(ordered_pair(esk1_0,esk2_0),cartesian_product2(singleton(esk3_0),esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( ~ in(ordered_pair(esk1_0,esk2_0),cartesian_product2(singleton(esk3_0),esk4_0))
| esk1_0 != esk3_0
| ~ in(esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
in(esk2_0,esk4_0),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
~ in(ordered_pair(esk3_0,esk2_0),cartesian_product2(singleton(esk3_0),esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),c_0_15]),c_0_15])]) ).
cnf(c_0_18,plain,
( in(ordered_pair(X1,X3),cartesian_product2(X2,X4))
| ~ in(X1,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET975+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 17:02:44 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.zKdiKtfD7U/E---3.1_19551.p
% 0.19/0.48 # Version: 3.1pre001
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # new_bool_1 with pid 19630 completed with status 0
% 0.19/0.48 # Result found by new_bool_1
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSS-FFSS21-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # SAT001_MinMin_p005000_rr_RG with pid 19632 completed with status 0
% 0.19/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHSS-FFSS21-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 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 : 9
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 16
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 16
% 0.19/0.48 # Processed clauses : 42
% 0.19/0.48 # ...of these trivial : 1
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 41
% 0.19/0.48 # Other redundant clauses eliminated : 3
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 5
% 0.19/0.48 # Generated clauses : 24
% 0.19/0.48 # ...of the previous two non-redundant : 18
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 1
% 0.19/0.48 # Paramodulations : 22
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 3
% 0.19/0.48 # Total rewrite steps : 15
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 18
% 0.19/0.48 # Positive orientable unit clauses : 6
% 0.19/0.48 # Positive unorientable unit clauses: 1
% 0.19/0.48 # Negative unit clauses : 5
% 0.19/0.48 # Non-unit-clauses : 6
% 0.19/0.48 # Current number of unprocessed clauses: 6
% 0.19/0.48 # ...number of literals in the above : 8
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 21
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 50
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 50
% 0.19/0.48 # Non-unit clause-clause subsumptions : 1
% 0.19/0.48 # Unit Clause-clause subsumption calls : 13
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 7
% 0.19/0.48 # BW rewrite match successes : 6
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 1115
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.004 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.006 s
% 0.19/0.48 # Maximum resident set size: 1732 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.003 s
% 0.19/0.48 # Total time : 0.010 s
% 0.19/0.48 # Maximum resident set size: 1680 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------