TSTP Solution File: SET658+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET658+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:23:17 EDT 2023
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% 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/tmp/tmp.erOKrwRdRj/E---3.1_19841.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/tmp/tmp.erOKrwRdRj/E---3.1_19841.p',p1) ).
fof(p28,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox/tmp/tmp.erOKrwRdRj/E---3.1_19841.p',p28) ).
fof(p15,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> subset(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.erOKrwRdRj/E---3.1_19841.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,
! [X5,X6] :
( ~ ilf_type(X5,set_type)
| ~ ilf_type(X6,binary_relation_type)
| ~ subset(domain_of(X6),X5)
| ilf_type(X6,relation_type(X5,range_of(X6))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
fof(c_0_6,plain,
! [X74] : ilf_type(X74,set_type),
inference(variable_rename,[status(thm)],[p28]) ).
fof(c_0_7,plain,
! [X38] :
( ~ ilf_type(X38,set_type)
| subset(X38,X38) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p15])]) ).
fof(c_0_8,negated_conjecture,
( ilf_type(esk13_0,binary_relation_type)
& ~ ilf_type(esk13_0,relation_type(domain_of(esk13_0),range_of(esk13_0))) ),
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(esk13_0,relation_type(domain_of(esk13_0),range_of(esk13_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(esk13_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.05/0.11 % Problem : SET658+3 : TPTP v8.1.2. Released v2.2.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n015.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 16:49:16 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.erOKrwRdRj/E---3.1_19841.p
% 0.16/0.45 # Version: 3.1pre001
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19974 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FGHSF-FFMF31-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 756s (1) cores
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.45 # Starting new_bool_3 with 162s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 158s (1) cores
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.45 # G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with pid 19980 completed with status 0
% 0.16/0.45 # Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: FGHSF-FFMF31-SFFFFFNN
% 0.16/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 756s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 29
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 53
% 0.16/0.45 # Removed in clause preprocessing : 1
% 0.16/0.45 # Initial clauses in saturation : 52
% 0.16/0.45 # Processed clauses : 69
% 0.16/0.45 # ...of these trivial : 13
% 0.16/0.45 # ...subsumed : 0
% 0.16/0.45 # ...remaining for further processing : 56
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 4
% 0.16/0.45 # ...of the previous two non-redundant : 1
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 1
% 0.16/0.45 # Paramodulations : 4
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Total rewrite steps : 93
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 17
% 0.16/0.45 # Positive orientable unit clauses : 6
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 2
% 0.16/0.45 # Non-unit-clauses : 9
% 0.16/0.45 # Current number of unprocessed clauses: 23
% 0.16/0.45 # ...number of literals in the above : 54
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 39
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 159
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 131
% 0.16/0.45 # Non-unit clause-clause subsumptions : 1
% 0.16/0.45 # Unit Clause-clause subsumption calls : 5
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 0
% 0.16/0.45 # BW rewrite match successes : 0
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 4448
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.005 s
% 0.16/0.45 # System time : 0.003 s
% 0.16/0.45 # Total time : 0.008 s
% 0.16/0.45 # Maximum resident set size: 1872 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.021 s
% 0.16/0.45 # System time : 0.006 s
% 0.16/0.45 # Total time : 0.027 s
% 0.16/0.45 # Maximum resident set size: 1708 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------