TSTP Solution File: SEU263+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU263+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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 : 600s
% DateTime : Tue Jul 19 09:18:24 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 9 unt; 0 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 103 ( 43 ~; 40 |; 8 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 118 ( 12 sgn 63 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
<=> subset(X3,cartesian_product2(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_m2_relset_1) ).
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_xboole_1) ).
fof(t14_relset_1,conjecture,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(relation_rng(X4),X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t14_relset_1) ).
fof(t119_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t119_zfmisc_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cc1_relset_1) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_m2_relset_1) ).
fof(t21_relat_1,axiom,
! [X1] :
( relation(X1)
=> subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t21_relat_1) ).
fof(t12_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t12_relset_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(c_0_10,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ relation_of2(X6,X4,X5)
| subset(X6,cartesian_product2(X4,X5)) )
& ( ~ subset(X6,cartesian_product2(X4,X5))
| relation_of2(X6,X4,X5) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_relset_1])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ relation_of2_as_subset(X6,X4,X5)
| relation_of2(X6,X4,X5) )
& ( ~ relation_of2(X6,X4,X5)
| relation_of2_as_subset(X6,X4,X5) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])])]) ).
fof(c_0_12,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
cnf(c_0_13,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(relation_rng(X4),X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
inference(assume_negation,[status(cth)],[t14_relset_1]) ).
fof(c_0_16,plain,
! [X5,X6,X7,X8] :
( ~ subset(X5,X6)
| ~ subset(X7,X8)
| subset(cartesian_product2(X5,X7),cartesian_product2(X6,X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t119_zfmisc_1])]) ).
fof(c_0_17,plain,
! [X4,X5,X6] :
( ~ element(X6,powerset(cartesian_product2(X4,X5)))
| relation(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
fof(c_0_18,plain,
! [X4,X5,X6] :
( ~ relation_of2_as_subset(X6,X4,X5)
| element(X6,powerset(cartesian_product2(X4,X5))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_21,negated_conjecture,
( relation_of2_as_subset(esk7_0,esk6_0,esk4_0)
& subset(relation_rng(esk7_0),esk5_0)
& ~ relation_of2_as_subset(esk7_0,esk6_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_22,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ subset(X2,X4)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
! [X2] :
( ~ relation(X2)
| subset(X2,cartesian_product2(relation_dom(X2),relation_rng(X2))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_relat_1])]) ).
cnf(c_0_24,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( relation_of2(X1,X2,X3)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ relation_of2_as_subset(X4,X2,X3)
| ~ subset(X1,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
relation_of2_as_subset(esk7_0,esk6_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ subset(X1,cartesian_product2(X4,X5))
| ~ subset(X5,X3)
| ~ subset(X4,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_31,plain,
( subset(X1,cartesian_product2(relation_dom(X1),relation_rng(X1)))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_33,plain,
! [X4,X5,X6] :
( ( subset(relation_dom(X6),X4)
| ~ relation_of2_as_subset(X6,X4,X5) )
& ( subset(relation_rng(X6),X5)
| ~ relation_of2_as_subset(X6,X4,X5) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_relset_1])])]) ).
cnf(c_0_34,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ subset(X1,cartesian_product2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( subset(X1,cartesian_product2(esk6_0,esk4_0))
| ~ subset(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ subset(relation_rng(X1),X3)
| ~ subset(relation_dom(X1),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
subset(relation_rng(esk7_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_38,negated_conjecture,
relation(esk7_0),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_39,plain,
( subset(relation_dom(X1),X2)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( relation_of2_as_subset(X1,esk6_0,esk4_0)
| ~ subset(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_41,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_42,negated_conjecture,
( subset(esk7_0,cartesian_product2(X1,esk5_0))
| ~ subset(relation_dom(esk7_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_43,negated_conjecture,
( subset(relation_dom(X1),esk6_0)
| ~ subset(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_45,negated_conjecture,
subset(esk7_0,cartesian_product2(esk6_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_46,negated_conjecture,
~ relation_of2_as_subset(esk7_0,esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU263+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 20:39:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.014 s
% 0.23/1.40
% 0.23/1.40 # Failure: Out of unprocessed clauses!
% 0.23/1.40 # OLD status GaveUp
% 0.23/1.40 # Parsed axioms : 20
% 0.23/1.40 # Removed by relevancy pruning/SinE : 16
% 0.23/1.40 # Initial clauses : 6
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 6
% 0.23/1.40 # Processed clauses : 7
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 0
% 0.23/1.40 # ...remaining for further processing : 7
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 0
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 3
% 0.23/1.40 # ...of the previous two non-trivial : 1
% 0.23/1.40 # Contextual simplify-reflections : 0
% 0.23/1.40 # Paramodulations : 3
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 7
% 0.23/1.40 # Positive orientable unit clauses : 4
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 1
% 0.23/1.40 # Non-unit-clauses : 2
% 0.23/1.40 # Current number of unprocessed clauses: 0
% 0.23/1.40 # ...number of literals in the above : 0
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 0
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.40 # Non-unit clause-clause subsumptions : 0
% 0.23/1.40 # Unit Clause-clause subsumption calls : 0
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 1
% 0.23/1.40 # BW rewrite match successes : 0
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 416
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.010 s
% 0.23/1.40 # System time : 0.004 s
% 0.23/1.40 # Total time : 0.014 s
% 0.23/1.40 # Maximum resident set size: 2784 pages
% 0.23/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.40 # Preprocessing time : 0.015 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 48
% 0.23/1.40 # Proof object clause steps : 27
% 0.23/1.40 # Proof object formula steps : 21
% 0.23/1.40 # Proof object conjectures : 13
% 0.23/1.40 # Proof object clause conjectures : 10
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 14
% 0.23/1.40 # Proof object initial formulas used : 10
% 0.23/1.40 # Proof object generating inferences : 13
% 0.23/1.40 # Proof object simplifying inferences : 5
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 20
% 0.23/1.40 # Removed by relevancy pruning/SinE : 0
% 0.23/1.40 # Initial clauses : 26
% 0.23/1.40 # Removed in clause preprocessing : 6
% 0.23/1.40 # Initial clauses in saturation : 20
% 0.23/1.40 # Processed clauses : 1062
% 0.23/1.40 # ...of these trivial : 5
% 0.23/1.40 # ...subsumed : 370
% 0.23/1.40 # ...remaining for further processing : 687
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 4
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 6129
% 0.23/1.40 # ...of the previous two non-trivial : 5952
% 0.23/1.40 # Contextual simplify-reflections : 369
% 0.23/1.40 # Paramodulations : 6129
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 683
% 0.23/1.40 # Positive orientable unit clauses : 133
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 2
% 0.23/1.40 # Non-unit-clauses : 548
% 0.23/1.40 # Current number of unprocessed clauses: 4894
% 0.23/1.40 # ...number of literals in the above : 11932
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 4
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 101451
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 90630
% 0.23/1.40 # Non-unit clause-clause subsumptions : 743
% 0.23/1.40 # Unit Clause-clause subsumption calls : 1056
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 385
% 0.23/1.40 # BW rewrite match successes : 0
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 90179
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.133 s
% 0.23/1.40 # System time : 0.006 s
% 0.23/1.40 # Total time : 0.139 s
% 0.23/1.40 # Maximum resident set size: 8332 pages
%------------------------------------------------------------------------------