TSTP Solution File: SET949+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET949+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 47 ( 21 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 61 ( 24 ~; 23 |; 12 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 39 ( 2 sgn; 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_zfmisc_1,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( in(X5,X1)
& in(X6,X2)
& X4 = ordered_pair(X5,X6) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RVLNb3LcXt/E---3.1_6844.p',d2_zfmisc_1) ).
fof(t102_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( in(X1,cartesian_product2(X2,X3))
& ! [X4,X5] : ordered_pair(X4,X5) != X1 ),
file('/export/starexec/sandbox2/tmp/tmp.RVLNb3LcXt/E---3.1_6844.p',t102_zfmisc_1) ).
fof(c_0_2,plain,
! [X16,X17,X18,X19,X22,X23,X24,X25,X26,X27,X29,X30] :
( ( in(esk4_4(X16,X17,X18,X19),X16)
| ~ in(X19,X18)
| X18 != cartesian_product2(X16,X17) )
& ( in(esk5_4(X16,X17,X18,X19),X17)
| ~ in(X19,X18)
| X18 != cartesian_product2(X16,X17) )
& ( X19 = ordered_pair(esk4_4(X16,X17,X18,X19),esk5_4(X16,X17,X18,X19))
| ~ in(X19,X18)
| X18 != cartesian_product2(X16,X17) )
& ( ~ in(X23,X16)
| ~ in(X24,X17)
| X22 != ordered_pair(X23,X24)
| in(X22,X18)
| X18 != cartesian_product2(X16,X17) )
& ( ~ in(esk6_3(X25,X26,X27),X27)
| ~ in(X29,X25)
| ~ in(X30,X26)
| esk6_3(X25,X26,X27) != ordered_pair(X29,X30)
| X27 = cartesian_product2(X25,X26) )
& ( in(esk7_3(X25,X26,X27),X25)
| in(esk6_3(X25,X26,X27),X27)
| X27 = cartesian_product2(X25,X26) )
& ( in(esk8_3(X25,X26,X27),X26)
| in(esk6_3(X25,X26,X27),X27)
| X27 = cartesian_product2(X25,X26) )
& ( esk6_3(X25,X26,X27) = ordered_pair(esk7_3(X25,X26,X27),esk8_3(X25,X26,X27))
| in(esk6_3(X25,X26,X27),X27)
| X27 = cartesian_product2(X25,X26) ) ),
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)],[d2_zfmisc_1])])])])])]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( in(X1,cartesian_product2(X2,X3))
& ! [X4,X5] : ordered_pair(X4,X5) != X1 ),
inference(assume_negation,[status(cth)],[t102_zfmisc_1]) ).
cnf(c_0_4,plain,
( X1 = ordered_pair(esk4_4(X2,X3,X4,X1),esk5_4(X2,X3,X4,X1))
| ~ in(X1,X4)
| X4 != cartesian_product2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
! [X10,X11] :
( in(esk1_0,cartesian_product2(esk2_0,esk3_0))
& ordered_pair(X10,X11) != esk1_0 ),
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,
( ordered_pair(esk4_4(X1,X2,cartesian_product2(X1,X2),X3),esk5_4(X1,X2,cartesian_product2(X1,X2),X3)) = X3
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
in(esk1_0,cartesian_product2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
ordered_pair(X1,X2) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET949+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n028.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 17:24:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/tmp/tmp.RVLNb3LcXt/E---3.1_6844.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_3 with pid 6988 completed with status 0
% 0.20/0.52 # Result found by new_bool_3
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSF-FFSF33-SFFFFFNN
% 0.20/0.52 # partial match(1): FGHSF-FFSF32-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 6995 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSF-FFSF33-SFFFFFNN
% 0.20/0.52 # partial match(1): FGHSF-FFSF32-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 8
% 0.20/0.52 # Removed by relevancy pruning/SinE : 2
% 0.20/0.52 # Initial clauses : 14
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 14
% 0.20/0.52 # Processed clauses : 45
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 0
% 0.20/0.52 # ...remaining for further processing : 45
% 0.20/0.52 # Other redundant clauses eliminated : 5
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 0
% 0.20/0.52 # Generated clauses : 52
% 0.20/0.52 # ...of the previous two non-redundant : 49
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 48
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 5
% 0.20/0.52 # Total rewrite steps : 0
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 27
% 0.20/0.52 # Positive orientable unit clauses : 6
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 8
% 0.20/0.52 # Non-unit-clauses : 13
% 0.20/0.52 # Current number of unprocessed clauses: 28
% 0.20/0.52 # ...number of literals in the above : 70
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 14
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 37
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 33
% 0.20/0.52 # Non-unit clause-clause subsumptions : 0
% 0.20/0.52 # Unit Clause-clause subsumption calls : 10
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 0
% 0.20/0.52 # BW rewrite match successes : 0
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 1880
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.009 s
% 0.20/0.52 # System time : 0.004 s
% 0.20/0.52 # Total time : 0.013 s
% 0.20/0.52 # Maximum resident set size: 1704 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.011 s
% 0.20/0.52 # System time : 0.008 s
% 0.20/0.52 # Total time : 0.018 s
% 0.20/0.52 # Maximum resident set size: 1684 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------