TSTP Solution File: SET988+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET988+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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:24:52 EDT 2024
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 74 ( 20 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 83 ( 31 ~; 26 |; 18 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 53 ( 2 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_funct_1,conjecture,
! [X1] :
( ( ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : ordered_pair(X3,X4) != X2 )
& ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X2,X4),X1) )
=> X3 = X4 ) )
=> ( relation(X1)
& function(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OtgsJ575dJ/E---3.1_21771.p',t2_funct_1) ).
fof(d1_funct_1,axiom,
! [X1] :
( function(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X2,X4),X1) )
=> X3 = X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.OtgsJ575dJ/E---3.1_21771.p',d1_funct_1) ).
fof(d1_relat_1,axiom,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OtgsJ575dJ/E---3.1_21771.p',d1_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : ordered_pair(X3,X4) != X2 )
& ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X2,X4),X1) )
=> X3 = X4 ) )
=> ( relation(X1)
& function(X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t2_funct_1])]) ).
fof(c_0_4,negated_conjecture,
! [X6,X9,X10,X11] :
( ( ~ in(X6,esk1_0)
| ordered_pair(esk2_1(X6),esk3_1(X6)) = X6 )
& ( ~ in(ordered_pair(X9,X10),esk1_0)
| ~ in(ordered_pair(X9,X11),esk1_0)
| X10 = X11 )
& ( ~ relation(esk1_0)
| ~ function(esk1_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])])])])]) ).
fof(c_0_5,plain,
! [X14,X15,X16,X17,X18] :
( ( ~ function(X14)
| ~ in(ordered_pair(X15,X16),X14)
| ~ in(ordered_pair(X15,X17),X14)
| X16 = X17 )
& ( in(ordered_pair(esk5_1(X18),esk6_1(X18)),X18)
| function(X18) )
& ( in(ordered_pair(esk5_1(X18),esk7_1(X18)),X18)
| function(X18) )
& ( esk6_1(X18) != esk7_1(X18)
| function(X18) ) ),
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)],[d1_funct_1])])])])])])]) ).
cnf(c_0_6,negated_conjecture,
( X2 = X3
| ~ in(ordered_pair(X1,X2),esk1_0)
| ~ in(ordered_pair(X1,X3),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( in(ordered_pair(esk5_1(X1),esk6_1(X1)),X1)
| function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) ) ),
inference(fof_simplification,[status(thm)],[d1_relat_1]) ).
cnf(c_0_9,negated_conjecture,
( X1 = esk6_1(esk1_0)
| function(esk1_0)
| ~ in(ordered_pair(esk5_1(esk1_0),X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( in(ordered_pair(esk5_1(X1),esk7_1(X1)),X1)
| function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( function(X1)
| esk6_1(X1) != esk7_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_12,plain,
! [X41,X42,X45,X47,X48] :
( ( ~ relation(X41)
| ~ in(X42,X41)
| X42 = ordered_pair(esk10_2(X41,X42),esk11_2(X41,X42)) )
& ( in(esk12_1(X45),X45)
| relation(X45) )
& ( esk12_1(X45) != ordered_pair(X47,X48)
| relation(X45) ) ),
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)],[c_0_8])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ relation(esk1_0)
| ~ function(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
function(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ordered_pair(esk2_1(X1),esk3_1(X1)) = X1
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( in(esk12_1(X1),X1)
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ relation(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_18,plain,
( relation(X1)
| esk12_1(X1) != ordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
ordered_pair(esk2_1(esk12_1(esk1_0)),esk3_1(esk12_1(esk1_0))) = esk12_1(esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( relation(X1)
| esk12_1(X1) != esk12_1(esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_20]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SET988+1 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n009.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 : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 10:11:55 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.44 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.OtgsJ575dJ/E---3.1_21771.p
% 0.17/0.45 # Version: 3.1.0
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # new_bool_3 with pid 21852 completed with status 0
% 0.17/0.45 # Result found by new_bool_3
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHSS-FFMM21-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 181s (1) cores
% 0.17/0.45 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 21856 completed with status 0
% 0.17/0.45 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHSS-FFMM21-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 181s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 33
% 0.17/0.45 # Removed by relevancy pruning/SinE : 11
% 0.17/0.45 # Initial clauses : 34
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 34
% 0.17/0.45 # Processed clauses : 95
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 10
% 0.17/0.45 # ...remaining for further processing : 85
% 0.17/0.45 # Other redundant clauses eliminated : 6
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 7
% 0.17/0.45 # Generated clauses : 136
% 0.17/0.45 # ...of the previous two non-redundant : 121
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 1
% 0.17/0.45 # Paramodulations : 129
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 7
% 0.17/0.45 # Disequality decompositions : 0
% 0.17/0.45 # Total rewrite steps : 15
% 0.17/0.45 # ...of those cached : 8
% 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 : 44
% 0.17/0.45 # Positive orientable unit clauses : 12
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 7
% 0.17/0.45 # Non-unit-clauses : 25
% 0.17/0.45 # Current number of unprocessed clauses: 89
% 0.17/0.45 # ...number of literals in the above : 292
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 41
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 55
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 49
% 0.17/0.45 # Non-unit clause-clause subsumptions : 6
% 0.17/0.45 # Unit Clause-clause subsumption calls : 10
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 3
% 0.17/0.45 # BW rewrite match successes : 3
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 3408
% 0.17/0.45 # Search garbage collected termcells : 560
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.008 s
% 0.17/0.45 # System time : 0.001 s
% 0.17/0.45 # Total time : 0.009 s
% 0.17/0.45 # Maximum resident set size: 1860 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.010 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.012 s
% 0.17/0.45 # Maximum resident set size: 1716 pages
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------