TSTP Solution File: SET949+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---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 : n027.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:21:23 EDT 2023
% Result : Theorem 0.18s 0.45s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 48 ( 21 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 62 ( 25 ~; 23 |; 12 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 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 : 41 ( 4 sgn; 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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.STzcRbmKov/E---3.1_7775.p',t102_zfmisc_1) ).
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.STzcRbmKov/E---3.1_7775.p',d2_zfmisc_1) ).
fof(c_0_2,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]) ).
fof(c_0_3,plain,
! [X12,X13,X14,X15,X18,X19,X20,X21,X22,X23,X25,X26] :
( ( in(esk4_4(X12,X13,X14,X15),X12)
| ~ in(X15,X14)
| X14 != cartesian_product2(X12,X13) )
& ( in(esk5_4(X12,X13,X14,X15),X13)
| ~ in(X15,X14)
| X14 != cartesian_product2(X12,X13) )
& ( X15 = ordered_pair(esk4_4(X12,X13,X14,X15),esk5_4(X12,X13,X14,X15))
| ~ in(X15,X14)
| X14 != cartesian_product2(X12,X13) )
& ( ~ in(X19,X12)
| ~ in(X20,X13)
| X18 != ordered_pair(X19,X20)
| in(X18,X14)
| X14 != cartesian_product2(X12,X13) )
& ( ~ in(esk6_3(X21,X22,X23),X23)
| ~ in(X25,X21)
| ~ in(X26,X22)
| esk6_3(X21,X22,X23) != ordered_pair(X25,X26)
| X23 = cartesian_product2(X21,X22) )
& ( in(esk7_3(X21,X22,X23),X21)
| in(esk6_3(X21,X22,X23),X23)
| X23 = cartesian_product2(X21,X22) )
& ( in(esk8_3(X21,X22,X23),X22)
| in(esk6_3(X21,X22,X23),X23)
| X23 = cartesian_product2(X21,X22) )
& ( esk6_3(X21,X22,X23) = ordered_pair(esk7_3(X21,X22,X23),esk8_3(X21,X22,X23))
| in(esk6_3(X21,X22,X23),X23)
| X23 = cartesian_product2(X21,X22) ) ),
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_4,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_2])])])]) ).
cnf(c_0_5,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_3]) ).
cnf(c_0_6,negated_conjecture,
ordered_pair(X1,X2) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,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_5]) ).
cnf(c_0_8,negated_conjecture,
in(esk1_0,cartesian_product2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
~ in(esk1_0,cartesian_product2(X1,X2)),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_8,c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET949+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 17:32:00 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.STzcRbmKov/E---3.1_7775.p
% 0.18/0.45 # Version: 3.1pre001
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # sh5l with pid 7856 completed with status 0
% 0.18/0.45 # Result found by sh5l
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.45 # Search class: FGHSS-FFSF32-SFFFFFNN
% 0.18/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.45 # SAT001_MinMin_p005000_rr_RG with pid 7861 completed with status 0
% 0.18/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.45 # Search class: FGHSS-FFSF32-SFFFFFNN
% 0.18/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.45 # Preprocessing time : 0.001 s
% 0.18/0.45 # Presaturation interreduction done
% 0.18/0.45
% 0.18/0.45 # Proof found!
% 0.18/0.45 # SZS status Theorem
% 0.18/0.45 # SZS output start CNFRefutation
% See solution above
% 0.18/0.45 # Parsed axioms : 8
% 0.18/0.45 # Removed by relevancy pruning/SinE : 0
% 0.18/0.45 # Initial clauses : 16
% 0.18/0.45 # Removed in clause preprocessing : 0
% 0.18/0.45 # Initial clauses in saturation : 16
% 0.18/0.45 # Processed clauses : 52
% 0.18/0.45 # ...of these trivial : 5
% 0.18/0.45 # ...subsumed : 0
% 0.18/0.45 # ...remaining for further processing : 47
% 0.18/0.45 # Other redundant clauses eliminated : 6
% 0.18/0.45 # Clauses deleted for lack of memory : 0
% 0.18/0.45 # Backward-subsumed : 0
% 0.18/0.45 # Backward-rewritten : 0
% 0.18/0.45 # Generated clauses : 59
% 0.18/0.45 # ...of the previous two non-redundant : 48
% 0.18/0.45 # ...aggressively subsumed : 0
% 0.18/0.45 # Contextual simplify-reflections : 0
% 0.18/0.45 # Paramodulations : 53
% 0.18/0.45 # Factorizations : 0
% 0.18/0.45 # NegExts : 0
% 0.18/0.45 # Equation resolutions : 6
% 0.18/0.45 # Total rewrite steps : 15
% 0.18/0.45 # Propositional unsat checks : 0
% 0.18/0.45 # Propositional check models : 0
% 0.18/0.45 # Propositional check unsatisfiable : 0
% 0.18/0.45 # Propositional clauses : 0
% 0.18/0.45 # Propositional clauses after purity: 0
% 0.18/0.45 # Propositional unsat core size : 0
% 0.18/0.45 # Propositional preprocessing time : 0.000
% 0.18/0.45 # Propositional encoding time : 0.000
% 0.18/0.45 # Propositional solver time : 0.000
% 0.18/0.45 # Success case prop preproc time : 0.000
% 0.18/0.45 # Success case prop encoding time : 0.000
% 0.18/0.45 # Success case prop solver time : 0.000
% 0.18/0.45 # Current number of processed clauses : 26
% 0.18/0.45 # Positive orientable unit clauses : 6
% 0.18/0.45 # Positive unorientable unit clauses: 1
% 0.18/0.45 # Negative unit clauses : 5
% 0.18/0.45 # Non-unit-clauses : 14
% 0.18/0.45 # Current number of unprocessed clauses: 28
% 0.18/0.45 # ...number of literals in the above : 48
% 0.18/0.45 # Current number of archived formulas : 0
% 0.18/0.45 # Current number of archived clauses : 17
% 0.18/0.45 # Clause-clause subsumption calls (NU) : 48
% 0.18/0.45 # Rec. Clause-clause subsumption calls : 43
% 0.18/0.45 # Non-unit clause-clause subsumptions : 0
% 0.18/0.45 # Unit Clause-clause subsumption calls : 8
% 0.18/0.45 # Rewrite failures with RHS unbound : 0
% 0.18/0.45 # BW rewrite match attempts : 6
% 0.18/0.45 # BW rewrite match successes : 4
% 0.18/0.45 # Condensation attempts : 0
% 0.18/0.45 # Condensation successes : 0
% 0.18/0.45 # Termbank termtop insertions : 1590
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.006 s
% 0.18/0.45 # System time : 0.000 s
% 0.18/0.45 # Total time : 0.006 s
% 0.18/0.45 # Maximum resident set size: 1728 pages
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.006 s
% 0.18/0.45 # System time : 0.003 s
% 0.18/0.45 # Total time : 0.009 s
% 0.18/0.45 # Maximum resident set size: 1680 pages
% 0.18/0.45 % E---3.1 exiting
% 0.18/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------