TSTP Solution File: CSR023+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CSR023+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 02:11:06 EDT 2024
% Result : Theorem 0.42s 1.10s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 19 unt; 0 def)
% Number of atoms : 220 ( 106 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 245 ( 82 ~; 87 |; 64 &)
% ( 10 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn 74 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X3,X4,X1] :
( ( initiates(X3,X1,X4)
& happens(X3,X4) )
=> holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',happens_holds) ).
fof(f13,axiom,
! [X3,X1,X4] :
( initiates(X3,X1,X4)
<=> ( ( happens(push,X4)
& spinning = X1
& pull = X3 )
| ( ~ happens(push,X4)
& backwards = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& forwards = X1
& push = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initiates_all_defn) ).
fof(f16,axiom,
! [X3,X4] :
( happens(X3,X4)
<=> ( ( n2 = X4
& push = X3 )
| ( n2 = X4
& pull = X3 )
| ( n1 = X4
& pull = X3 )
| ( n0 = X4
& push = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f26,axiom,
n3 = plus(n1,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).
fof(f31,axiom,
! [X8,X9] : plus(X8,X9) = plus(X9,X8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f48,conjecture,
holdsAt(spinning,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',spinning_3) ).
fof(f49,negated_conjecture,
~ holdsAt(spinning,n3),
inference(negated_conjecture,[],[f48]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ( initiates(X0,X2,X1)
& happens(X0,X1) )
=> holdsAt(X2,plus(X1,n1)) ),
inference(rectify,[],[f9]) ).
fof(f61,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| ( ~ happens(push,X2)
& backwards = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& forwards = X1
& push = X0 ) ) ),
inference(rectify,[],[f13]) ).
fof(f64,plain,
! [X0,X1] :
( happens(X0,X1)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| ( n0 = X1
& push = X0 ) ) ),
inference(rectify,[],[f16]) ).
fof(f65,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(rectify,[],[f31]) ).
fof(f79,plain,
~ holdsAt(spinning,n3),
inference(flattening,[],[f49]) ).
fof(f94,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ initiates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(ennf_transformation,[],[f57]) ).
fof(f95,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ initiates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f103,plain,
! [X2,X1,X0] :
( sP0(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& forwards = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f104,plain,
! [X2,X1,X0] :
( sP1(X2,X1,X0)
<=> ( ~ happens(push,X2)
& backwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f105,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| sP1(X2,X1,X0)
| sP0(X2,X1,X0) ) ),
inference(definition_folding,[],[f61,f104,f103]) ).
fof(f113,plain,
! [X1,X0] :
( sP8(X1,X0)
<=> ( n0 = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP8])]) ).
fof(f114,plain,
! [X1,X0] :
( sP9(X1,X0)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])]) ).
fof(f115,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP9(X1,X0) ),
inference(definition_folding,[],[f64,f114,f113]) ).
fof(f130,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( ~ happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP1(X2,X1,X0)
& ~ sP0(X2,X1,X0) ) )
& ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| sP1(X2,X1,X0)
| sP0(X2,X1,X0)
| ~ initiates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f105]) ).
fof(f131,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( ~ happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP1(X2,X1,X0)
& ~ sP0(X2,X1,X0) ) )
& ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| sP1(X2,X1,X0)
| sP0(X2,X1,X0)
| ~ initiates(X0,X1,X2) ) ),
inference(flattening,[],[f130]) ).
fof(f151,plain,
! [X1,X0] :
( ( sP9(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP8(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0)
| ~ sP9(X1,X0) ) ),
inference(nnf_transformation,[],[f114]) ).
fof(f152,plain,
! [X1,X0] :
( ( sP9(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP8(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0)
| ~ sP9(X1,X0) ) ),
inference(flattening,[],[f151]) ).
fof(f153,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( n2 != X0
| push != X1 )
& ( n2 != X0
| pull != X1 )
& ( n1 != X0
| pull != X1 )
& ~ sP8(X0,X1) ) )
& ( ( n2 = X0
& push = X1 )
| ( n2 = X0
& pull = X1 )
| ( n1 = X0
& pull = X1 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(rectify,[],[f152]) ).
fof(f157,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X1,X0) )
& ( sP9(X1,X0)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f179,plain,
! [X2,X0,X1] :
( holdsAt(X2,plus(X1,n1))
| ~ initiates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f197,plain,
! [X2,X0,X1] :
( initiates(X0,X1,X2)
| ~ happens(push,X2)
| spinning != X1
| pull != X0 ),
inference(cnf_transformation,[],[f131]) ).
fof(f240,plain,
! [X0,X1] :
( sP9(X0,X1)
| n2 != X0
| pull != X1 ),
inference(cnf_transformation,[],[f153]) ).
fof(f241,plain,
! [X0,X1] :
( sP9(X0,X1)
| n2 != X0
| push != X1 ),
inference(cnf_transformation,[],[f153]) ).
fof(f246,plain,
! [X0,X1] :
( happens(X0,X1)
| ~ sP9(X1,X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f256,plain,
n3 = plus(n1,n2),
inference(cnf_transformation,[],[f26]) ).
fof(f261,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f65]) ).
fof(f291,plain,
~ holdsAt(spinning,n3),
inference(cnf_transformation,[],[f79]) ).
fof(f296,plain,
! [X2,X0] :
( initiates(X0,spinning,X2)
| ~ happens(push,X2)
| pull != X0 ),
inference(equality_resolution,[],[f197]) ).
fof(f297,plain,
! [X2] :
( initiates(pull,spinning,X2)
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f296]) ).
fof(f310,plain,
! [X1] :
( sP9(n2,X1)
| push != X1 ),
inference(equality_resolution,[],[f241]) ).
fof(f311,plain,
sP9(n2,push),
inference(equality_resolution,[],[f310]) ).
fof(f312,plain,
! [X1] :
( sP9(n2,X1)
| pull != X1 ),
inference(equality_resolution,[],[f240]) ).
fof(f313,plain,
sP9(n2,pull),
inference(equality_resolution,[],[f312]) ).
cnf(c_57,plain,
( ~ initiates(X0,X1,X2)
| ~ happens(X0,X2)
| holdsAt(X1,plus(X2,n1)) ),
inference(cnf_transformation,[],[f179]) ).
cnf(c_70,plain,
( ~ happens(push,X0)
| initiates(pull,spinning,X0) ),
inference(cnf_transformation,[],[f297]) ).
cnf(c_108,plain,
sP9(n2,push),
inference(cnf_transformation,[],[f311]) ).
cnf(c_109,plain,
sP9(n2,pull),
inference(cnf_transformation,[],[f313]) ).
cnf(c_123,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(cnf_transformation,[],[f246]) ).
cnf(c_134,plain,
plus(n1,n2) = n3,
inference(cnf_transformation,[],[f256]) ).
cnf(c_139,plain,
plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f261]) ).
cnf(c_169,negated_conjecture,
~ holdsAt(spinning,n3),
inference(cnf_transformation,[],[f291]) ).
cnf(c_436,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
cnf(c_2509,plain,
( X0 != push
| X1 != n2
| happens(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_108,c_436]) ).
cnf(c_2510,plain,
happens(push,n2),
inference(unflattening,[status(thm)],[c_2509]) ).
cnf(c_2522,plain,
( X0 != pull
| X1 != n2
| happens(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_109,c_436]) ).
cnf(c_2523,plain,
happens(pull,n2),
inference(unflattening,[status(thm)],[c_2522]) ).
cnf(c_10196,plain,
( ~ happens(pull,X0)
| ~ happens(push,X0)
| holdsAt(spinning,plus(X0,n1)) ),
inference(superposition,[status(thm)],[c_70,c_57]) ).
cnf(c_10462,plain,
( ~ happens(pull,X0)
| ~ happens(push,X0)
| holdsAt(spinning,plus(n1,X0)) ),
inference(superposition,[status(thm)],[c_139,c_10196]) ).
cnf(c_10648,plain,
( ~ happens(pull,n2)
| ~ happens(push,n2)
| holdsAt(spinning,n3) ),
inference(superposition,[status(thm)],[c_134,c_10462]) ).
cnf(c_10654,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10648,c_2523,c_2510,c_169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : CSR023+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n009.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 22:53:10 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.42/1.10 % SZS status Started for theBenchmark.p
% 0.42/1.10 % SZS status Theorem for theBenchmark.p
% 0.42/1.10
% 0.42/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.42/1.10
% 0.42/1.10 ------ iProver source info
% 0.42/1.10
% 0.42/1.10 git: date: 2024-05-02 19:28:25 +0000
% 0.42/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.42/1.10 git: non_committed_changes: false
% 0.42/1.10
% 0.42/1.10 ------ Parsing...
% 0.42/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.42/1.10
% 0.42/1.10 ------ Preprocessing... sup_sim: 2 sf_s rm: 3 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 10 0s sf_e pe_s pe_e
% 0.42/1.10
% 0.42/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.42/1.10
% 0.42/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.42/1.10 ------ Proving...
% 0.42/1.10 ------ Problem Properties
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 clauses 82
% 0.42/1.10 conjectures 1
% 0.42/1.10 EPR 65
% 0.42/1.10 Horn 56
% 0.42/1.10 unary 27
% 0.42/1.10 binary 31
% 0.42/1.10 lits 177
% 0.42/1.10 lits eq 54
% 0.42/1.10 fd_pure 0
% 0.42/1.10 fd_pseudo 0
% 0.42/1.10 fd_cond 18
% 0.42/1.10 fd_pseudo_cond 2
% 0.42/1.10 AC symbols 0
% 0.42/1.10
% 0.42/1.10 ------ Input Options Time Limit: Unbounded
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 ------
% 0.42/1.10 Current options:
% 0.42/1.10 ------
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 ------ Proving...
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 ------ Proving...
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 ------ Proving...
% 0.42/1.10
% 0.42/1.10
% 0.42/1.10 % SZS status Theorem for theBenchmark.p
% 0.42/1.10
% 0.42/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.10
% 0.42/1.11
%------------------------------------------------------------------------------