TSTP Solution File: SET997+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET997+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Tue May 21 03:00:39 EDT 2024
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 93 ( 18 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 120 ( 47 ~; 45 |; 19 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-3 aty)
% Number of variables : 41 ( 0 sgn 27 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t19_funct_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ! [X3] :
~ ( in(X3,X1)
& ! [X4] :
~ ( in(X4,relation_dom(X2))
& X3 = apply(X2,X4) ) )
=> subset(X1,relation_rng(X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_funct_1) ).
fof(d5_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,relation_dom(X1))
& X3 = apply(X1,X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_funct_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ! [X3] :
~ ( in(X3,X1)
& ! [X4] :
~ ( in(X4,relation_dom(X2))
& X3 = apply(X2,X4) ) )
=> subset(X1,relation_rng(X2)) ) ),
inference(assume_negation,[status(cth)],[t19_funct_1]) ).
fof(c_0_4,plain,
! [X20,X21,X22,X24,X25,X26,X28] :
( ( in(esk5_3(X20,X21,X22),relation_dom(X20))
| ~ in(X22,X21)
| X21 != relation_rng(X20)
| ~ relation(X20)
| ~ function(X20) )
& ( X22 = apply(X20,esk5_3(X20,X21,X22))
| ~ in(X22,X21)
| X21 != relation_rng(X20)
| ~ relation(X20)
| ~ function(X20) )
& ( ~ in(X25,relation_dom(X20))
| X24 != apply(X20,X25)
| in(X24,X21)
| X21 != relation_rng(X20)
| ~ relation(X20)
| ~ function(X20) )
& ( ~ in(esk6_2(X20,X26),X26)
| ~ in(X28,relation_dom(X20))
| esk6_2(X20,X26) != apply(X20,X28)
| X26 = relation_rng(X20)
| ~ relation(X20)
| ~ function(X20) )
& ( in(esk7_2(X20,X26),relation_dom(X20))
| in(esk6_2(X20,X26),X26)
| X26 = relation_rng(X20)
| ~ relation(X20)
| ~ function(X20) )
& ( esk6_2(X20,X26) = apply(X20,esk7_2(X20,X26))
| in(esk6_2(X20,X26),X26)
| X26 = relation_rng(X20)
| ~ relation(X20)
| ~ function(X20) ) ),
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)],[d5_funct_1])])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X7] :
( relation(esk2_0)
& function(esk2_0)
& ( in(esk3_1(X7),relation_dom(esk2_0))
| ~ in(X7,esk1_0) )
& ( X7 = apply(esk2_0,esk3_1(X7))
| ~ in(X7,esk1_0) )
& ~ subset(esk1_0,relation_rng(esk2_0)) ),
inference(distribute,[status(thm)],[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_6,plain,
! [X9,X10,X11,X12,X13] :
( ( ~ subset(X9,X10)
| ~ in(X11,X9)
| in(X11,X10) )
& ( in(esk4_2(X12,X13),X12)
| subset(X12,X13) )
& ( ~ in(esk4_2(X12,X13),X13)
| subset(X12,X13) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_7,plain,
( in(X3,X4)
| ~ in(X1,relation_dom(X2))
| X3 != apply(X2,X1)
| X4 != relation_rng(X2)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
~ subset(esk1_0,relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(apply(X1,X2),relation_rng(X1))
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,relation_dom(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])]) ).
cnf(c_0_11,negated_conjecture,
( X1 = apply(esk2_0,esk3_1(X1))
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( in(esk3_1(X1),relation_dom(esk2_0))
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( in(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
~ in(esk4_2(esk1_0,relation_rng(esk2_0)),relation_rng(esk2_0)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( in(X1,relation_rng(esk2_0))
| ~ in(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
in(esk4_2(esk1_0,relation_rng(esk2_0)),esk1_0),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET997+1 : TPTP v8.2.0. Released v3.2.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 11:16:08 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 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/benchmark/theBenchmark.p
% 0.16/0.43 # Version: 3.1.0
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # new_bool_3 with pid 22047 completed with status 0
% 0.16/0.43 # Result found by new_bool_3
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.16/0.43 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.16/0.43 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 22054 completed with status 0
% 0.16/0.43 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.16/0.43 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Theorem
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 32
% 0.16/0.43 # Removed by relevancy pruning/SinE : 5
% 0.16/0.43 # Initial clauses : 46
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 46
% 0.16/0.43 # Processed clauses : 125
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 11
% 0.16/0.43 # ...remaining for further processing : 114
% 0.16/0.43 # Other redundant clauses eliminated : 4
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 1
% 0.16/0.43 # Backward-rewritten : 5
% 0.16/0.43 # Generated clauses : 76
% 0.16/0.43 # ...of the previous two non-redundant : 62
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 1
% 0.16/0.43 # Paramodulations : 73
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 4
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 17
% 0.16/0.43 # ...of those cached : 10
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 59
% 0.16/0.43 # Positive orientable unit clauses : 14
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 11
% 0.16/0.43 # Non-unit-clauses : 34
% 0.16/0.43 # Current number of unprocessed clauses: 25
% 0.16/0.43 # ...number of literals in the above : 78
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 52
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 192
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 129
% 0.16/0.43 # Non-unit clause-clause subsumptions : 4
% 0.16/0.43 # Unit Clause-clause subsumption calls : 86
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 9
% 0.16/0.43 # BW rewrite match successes : 2
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 3640
% 0.16/0.43 # Search garbage collected termcells : 639
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.008 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.010 s
% 0.16/0.43 # Maximum resident set size: 1884 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.009 s
% 0.16/0.43 # System time : 0.004 s
% 0.16/0.43 # Total time : 0.013 s
% 0.16/0.43 # Maximum resident set size: 1720 pages
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------