TSTP Solution File: SET658+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET658+3 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 02:55:12 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 30 ( 13 ~; 10 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 1 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_relset_1_20,conjecture,
! [X1] :
( ilf_type(X1,binary_relation_type)
=> ilf_type(X1,relation_type(domain_of(X1),range_of(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_relset_1_20) ).
fof(p1,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,binary_relation_type)
=> ( subset(domain_of(X2),X1)
=> ilf_type(X2,relation_type(X1,range_of(X2))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p1) ).
fof(p28,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p28) ).
fof(p15,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> subset(X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p15) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,binary_relation_type)
=> ilf_type(X1,relation_type(domain_of(X1),range_of(X1))) ),
inference(assume_negation,[status(cth)],[prove_relset_1_20]) ).
fof(c_0_5,plain,
! [X13,X14] :
( ~ ilf_type(X13,set_type)
| ~ ilf_type(X14,binary_relation_type)
| ~ subset(domain_of(X14),X13)
| ilf_type(X14,relation_type(X13,range_of(X14))) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])])]) ).
fof(c_0_6,plain,
! [X12] : ilf_type(X12,set_type),
inference(variable_rename,[status(thm)],[p28]) ).
fof(c_0_7,plain,
! [X51] :
( ~ ilf_type(X51,set_type)
| subset(X51,X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p15])])]) ).
fof(c_0_8,negated_conjecture,
( ilf_type(esk1_0,binary_relation_type)
& ~ ilf_type(esk1_0,relation_type(domain_of(esk1_0),range_of(esk1_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_9,plain,
( ilf_type(X2,relation_type(X1,range_of(X2)))
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,binary_relation_type)
| ~ subset(domain_of(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( subset(X1,X1)
| ~ ilf_type(X1,set_type) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
~ ilf_type(esk1_0,relation_type(domain_of(esk1_0),range_of(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ilf_type(X1,relation_type(X2,range_of(X1)))
| ~ subset(domain_of(X1),X2)
| ~ ilf_type(X1,binary_relation_type) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_14,plain,
subset(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10])]) ).
cnf(c_0_15,negated_conjecture,
ilf_type(esk1_0,binary_relation_type),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET658+3 : TPTP v8.2.0. Released v2.2.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 11:22:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # sh5l with pid 16586 completed with status 0
% 0.20/0.51 # Result found by sh5l
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGHSF-FFMF31-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 152s (1) cores
% 0.20/0.51 # G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with pid 16599 completed with status 0
% 0.20/0.51 # Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGHSF-FFMF31-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 152s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 29
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 53
% 0.20/0.51 # Removed in clause preprocessing : 1
% 0.20/0.51 # Initial clauses in saturation : 52
% 0.20/0.51 # Processed clauses : 69
% 0.20/0.51 # ...of these trivial : 13
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 56
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 4
% 0.20/0.51 # ...of the previous two non-redundant : 1
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 1
% 0.20/0.51 # Paramodulations : 4
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 93
% 0.20/0.51 # ...of those cached : 75
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 17
% 0.20/0.51 # Positive orientable unit clauses : 6
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 2
% 0.20/0.51 # Non-unit-clauses : 9
% 0.20/0.51 # Current number of unprocessed clauses: 23
% 0.20/0.51 # ...number of literals in the above : 54
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 39
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 99
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 86
% 0.20/0.51 # Non-unit clause-clause subsumptions : 1
% 0.20/0.51 # Unit Clause-clause subsumption calls : 5
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 5011
% 0.20/0.51 # Search garbage collected termcells : 1129
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.013 s
% 0.20/0.51 # System time : 0.000 s
% 0.20/0.51 # Total time : 0.013 s
% 0.20/0.51 # Maximum resident set size: 1872 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.015 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.017 s
% 0.20/0.51 # Maximum resident set size: 1752 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------