TSTP Solution File: SEU264+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU264+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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 : Fri May 3 03:05:16 EDT 2024
% Result : Theorem 10.03s 2.21s
% Output : CNFRefutation 10.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 10 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 72 ( 29 ~; 21 |; 13 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 69 ( 2 sgn 45 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f199,axiom,
! [X0,X1,X2] :
( relation_of2_as_subset(X2,X0,X1)
=> ( subset(relation_rng(X2),X1)
& subset(relation_dom(X2),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_relset_1) ).
fof(f210,axiom,
! [X0,X1,X2,X3] :
( relation_of2_as_subset(X3,X2,X0)
=> ( subset(relation_rng(X3),X1)
=> relation_of2_as_subset(X3,X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_relset_1) ).
fof(f214,conjecture,
! [X0,X1,X2,X3] :
( relation_of2_as_subset(X3,X2,X0)
=> ( subset(X0,X1)
=> relation_of2_as_subset(X3,X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_relset_1) ).
fof(f215,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( relation_of2_as_subset(X3,X2,X0)
=> ( subset(X0,X1)
=> relation_of2_as_subset(X3,X2,X1) ) ),
inference(negated_conjecture,[],[f214]) ).
fof(f226,axiom,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f498,plain,
! [X0,X1,X2] :
( ( subset(relation_rng(X2),X1)
& subset(relation_dom(X2),X0) )
| ~ relation_of2_as_subset(X2,X0,X1) ),
inference(ennf_transformation,[],[f199]) ).
fof(f513,plain,
! [X0,X1,X2,X3] :
( relation_of2_as_subset(X3,X2,X1)
| ~ subset(relation_rng(X3),X1)
| ~ relation_of2_as_subset(X3,X2,X0) ),
inference(ennf_transformation,[],[f210]) ).
fof(f514,plain,
! [X0,X1,X2,X3] :
( relation_of2_as_subset(X3,X2,X1)
| ~ subset(relation_rng(X3),X1)
| ~ relation_of2_as_subset(X3,X2,X0) ),
inference(flattening,[],[f513]) ).
fof(f518,plain,
? [X0,X1,X2,X3] :
( ~ relation_of2_as_subset(X3,X2,X1)
& subset(X0,X1)
& relation_of2_as_subset(X3,X2,X0) ),
inference(ennf_transformation,[],[f215]) ).
fof(f519,plain,
? [X0,X1,X2,X3] :
( ~ relation_of2_as_subset(X3,X2,X1)
& subset(X0,X1)
& relation_of2_as_subset(X3,X2,X0) ),
inference(flattening,[],[f518]) ).
fof(f532,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f226]) ).
fof(f533,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f532]) ).
fof(f955,plain,
( ? [X0,X1,X2,X3] :
( ~ relation_of2_as_subset(X3,X2,X1)
& subset(X0,X1)
& relation_of2_as_subset(X3,X2,X0) )
=> ( ~ relation_of2_as_subset(sK114,sK113,sK112)
& subset(sK111,sK112)
& relation_of2_as_subset(sK114,sK113,sK111) ) ),
introduced(choice_axiom,[]) ).
fof(f956,plain,
( ~ relation_of2_as_subset(sK114,sK113,sK112)
& subset(sK111,sK112)
& relation_of2_as_subset(sK114,sK113,sK111) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK111,sK112,sK113,sK114])],[f519,f955]) ).
fof(f1489,plain,
! [X2,X0,X1] :
( subset(relation_rng(X2),X1)
| ~ relation_of2_as_subset(X2,X0,X1) ),
inference(cnf_transformation,[],[f498]) ).
fof(f1505,plain,
! [X2,X3,X0,X1] :
( relation_of2_as_subset(X3,X2,X1)
| ~ subset(relation_rng(X3),X1)
| ~ relation_of2_as_subset(X3,X2,X0) ),
inference(cnf_transformation,[],[f514]) ).
fof(f1512,plain,
relation_of2_as_subset(sK114,sK113,sK111),
inference(cnf_transformation,[],[f956]) ).
fof(f1513,plain,
subset(sK111,sK112),
inference(cnf_transformation,[],[f956]) ).
fof(f1514,plain,
~ relation_of2_as_subset(sK114,sK113,sK112),
inference(cnf_transformation,[],[f956]) ).
fof(f1528,plain,
! [X2,X0,X1] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f533]) ).
cnf(c_509,plain,
( ~ relation_of2_as_subset(X0,X1,X2)
| subset(relation_rng(X0),X2) ),
inference(cnf_transformation,[],[f1489]) ).
cnf(c_526,plain,
( ~ relation_of2_as_subset(X0,X1,X2)
| ~ subset(relation_rng(X0),X3)
| relation_of2_as_subset(X0,X1,X3) ),
inference(cnf_transformation,[],[f1505]) ).
cnf(c_533,negated_conjecture,
~ relation_of2_as_subset(sK114,sK113,sK112),
inference(cnf_transformation,[],[f1514]) ).
cnf(c_534,negated_conjecture,
subset(sK111,sK112),
inference(cnf_transformation,[],[f1513]) ).
cnf(c_535,negated_conjecture,
relation_of2_as_subset(sK114,sK113,sK111),
inference(cnf_transformation,[],[f1512]) ).
cnf(c_549,plain,
( ~ subset(X0,X1)
| ~ subset(X2,X0)
| subset(X2,X1) ),
inference(cnf_transformation,[],[f1528]) ).
cnf(c_25488,plain,
subset(relation_rng(sK114),sK111),
inference(superposition,[status(thm)],[c_535,c_509]) ).
cnf(c_25523,plain,
( ~ subset(X0,sK111)
| subset(X0,sK112) ),
inference(superposition,[status(thm)],[c_534,c_549]) ).
cnf(c_25579,plain,
( ~ subset(relation_rng(sK114),X0)
| relation_of2_as_subset(sK114,sK113,X0) ),
inference(superposition,[status(thm)],[c_535,c_526]) ).
cnf(c_25687,plain,
subset(relation_rng(sK114),sK112),
inference(superposition,[status(thm)],[c_25488,c_25523]) ).
cnf(c_26215,plain,
relation_of2_as_subset(sK114,sK113,sK112),
inference(superposition,[status(thm)],[c_25687,c_25579]) ).
cnf(c_26216,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_533,c_26215]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU264+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n031.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 18:29:16 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 10.03/2.21 % SZS status Started for theBenchmark.p
% 10.03/2.21 % SZS status Theorem for theBenchmark.p
% 10.03/2.21
% 10.03/2.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.03/2.21
% 10.03/2.21 ------ iProver source info
% 10.03/2.21
% 10.03/2.21 git: date: 2024-05-02 19:28:25 +0000
% 10.03/2.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.03/2.21 git: non_committed_changes: false
% 10.03/2.21
% 10.03/2.21 ------ Parsing...
% 10.03/2.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.03/2.21
% 10.03/2.21 ------ Preprocessing... sup_sim: 61 sf_s rm: 6 0s sf_e pe_s pe:1:0s pe:2:0s pe_e
% 10.03/2.21
% 10.03/2.21 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.03/2.21
% 10.03/2.21 ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 10.03/2.21 ------ Proving...
% 10.03/2.21 ------ Problem Properties
% 10.03/2.21
% 10.03/2.21
% 10.03/2.21 clauses 603
% 10.03/2.21 conjectures 3
% 10.03/2.21 EPR 101
% 10.03/2.21 Horn 472
% 10.03/2.21 unary 85
% 10.03/2.21 binary 157
% 10.03/2.21 lits 1796
% 10.03/2.21 lits eq 275
% 10.03/2.21 fd_pure 0
% 10.03/2.21 fd_pseudo 0
% 10.03/2.21 fd_cond 21
% 10.03/2.21 fd_pseudo_cond 99
% 10.03/2.21 AC symbols 0
% 10.03/2.21
% 10.03/2.21 ------ Input Options Time Limit: Unbounded
% 10.03/2.21
% 10.03/2.21
% 10.03/2.21 ------
% 10.03/2.21 Current options:
% 10.03/2.21 ------
% 10.03/2.21
% 10.03/2.21
% 10.03/2.21
% 10.03/2.21
% 10.03/2.21 ------ Proving...
% 10.03/2.21
% 10.03/2.21
% 10.03/2.21 % SZS status Theorem for theBenchmark.p
% 10.03/2.21
% 10.03/2.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.03/2.21
% 10.03/2.21
%------------------------------------------------------------------------------