TSTP Solution File: SET959+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET959+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:24 EDT 2023
% Result : Theorem 0.17s 0.44s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 57 ( 18 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 65 ( 26 ~; 20 |; 13 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn; 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t112_zfmisc_1,conjecture,
! [X1,X2] :
( ( ! [X3] :
~ ( in(X3,X1)
& ! [X4,X5] : X3 != ordered_pair(X4,X5) )
& ! [X3] :
~ ( in(X3,X2)
& ! [X4,X5] : X3 != ordered_pair(X4,X5) )
& ! [X3,X4] :
( in(ordered_pair(X3,X4),X1)
<=> in(ordered_pair(X3,X4),X2) ) )
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.8mDUo1W6rO/E---3.1_19662.p',t112_zfmisc_1) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.8mDUo1W6rO/E---3.1_19662.p',t2_tarski) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( ( ! [X3] :
~ ( in(X3,X1)
& ! [X4,X5] : X3 != ordered_pair(X4,X5) )
& ! [X3] :
~ ( in(X3,X2)
& ! [X4,X5] : X3 != ordered_pair(X4,X5) )
& ! [X3,X4] :
( in(ordered_pair(X3,X4),X1)
<=> in(ordered_pair(X3,X4),X2) ) )
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t112_zfmisc_1]) ).
fof(c_0_3,negated_conjecture,
! [X8,X11,X14,X15] :
( ( ~ in(X8,esk1_0)
| X8 = ordered_pair(esk3_1(X8),esk4_1(X8)) )
& ( ~ in(X11,esk2_0)
| X11 = ordered_pair(esk5_1(X11),esk6_1(X11)) )
& ( ~ in(ordered_pair(X14,X15),esk1_0)
| in(ordered_pair(X14,X15),esk2_0) )
& ( ~ in(ordered_pair(X14,X15),esk2_0)
| in(ordered_pair(X14,X15),esk1_0) )
& esk1_0 != esk2_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_4,negated_conjecture,
( in(ordered_pair(X1,X2),esk1_0)
| ~ in(ordered_pair(X1,X2),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( X1 = ordered_pair(esk5_1(X1),esk6_1(X1))
| ~ in(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X18,X19] :
( ( ~ in(esk7_2(X18,X19),X18)
| ~ in(esk7_2(X18,X19),X19)
| X18 = X19 )
& ( in(esk7_2(X18,X19),X18)
| in(esk7_2(X18,X19),X19)
| X18 = X19 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_tarski])])])]) ).
cnf(c_0_7,negated_conjecture,
( in(X1,esk1_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
( in(esk7_2(X1,X2),X1)
| in(esk7_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( esk2_0 = X1
| in(esk7_2(esk2_0,X1),esk1_0)
| in(esk7_2(esk2_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ in(esk7_2(X1,X2),X1)
| ~ in(esk7_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
in(esk7_2(esk2_0,esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_9]),c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( in(ordered_pair(X1,X2),esk2_0)
| ~ in(ordered_pair(X1,X2),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
( X1 = ordered_pair(esk3_1(X1),esk4_1(X1))
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
~ in(esk7_2(esk2_0,esk1_0),esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET959+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 17:14:09 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.8mDUo1W6rO/E---3.1_19662.p
% 0.17/0.44 # Version: 3.1pre001
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # new_bool_3 with pid 19741 completed with status 0
% 0.17/0.44 # Result found by new_bool_3
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # SAT001_MinMin_p005000_rr_RG with pid 19744 completed with status 0
% 0.17/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44 # Presaturation interreduction done
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Theorem
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 8
% 0.17/0.45 # Removed by relevancy pruning/SinE : 2
% 0.17/0.45 # Initial clauses : 11
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 11
% 0.17/0.45 # Processed clauses : 38
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 1
% 0.17/0.45 # ...remaining for further processing : 37
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 2
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 31
% 0.17/0.45 # ...of the previous two non-redundant : 22
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 27
% 0.17/0.45 # Factorizations : 4
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Total rewrite steps : 1
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 24
% 0.17/0.45 # Positive orientable unit clauses : 2
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 8
% 0.17/0.45 # Non-unit-clauses : 14
% 0.17/0.45 # Current number of unprocessed clauses: 5
% 0.17/0.45 # ...number of literals in the above : 13
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 13
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 40
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 37
% 0.17/0.45 # Non-unit clause-clause subsumptions : 2
% 0.17/0.45 # Unit Clause-clause subsumption calls : 7
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 0
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 1056
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.001 s
% 0.17/0.45 # System time : 0.003 s
% 0.17/0.45 # Total time : 0.004 s
% 0.17/0.45 # Maximum resident set size: 1744 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.002 s
% 0.17/0.45 # System time : 0.003 s
% 0.17/0.45 # Total time : 0.006 s
% 0.17/0.45 # Maximum resident set size: 1680 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------