TSTP Solution File: GEO498+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GEO498+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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 : Wed Aug 30 23:11:30 EDT 2023
% Result : Theorem 3.34s 1.16s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 14 unt; 0 def)
% Number of atoms : 35 ( 34 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 29 ( 14 ~; 6 |; 8 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn; 18 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f99,axiom,
! [X11,X12] : s(X11,s(X11,X12)) = X12,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_7) ).
fof(f100,conjecture,
! [X11,X12,X26,X15] :
( X12 = X15
| s(X11,X15) != X26
| s(X11,X12) != X26 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_8) ).
fof(f101,negated_conjecture,
~ ! [X11,X12,X26,X15] :
( X12 = X15
| s(X11,X15) != X26
| s(X11,X12) != X26 ),
inference(negated_conjecture,[],[f100]) ).
fof(f202,plain,
! [X0,X1] : s(X0,s(X0,X1)) = X1,
inference(rectify,[],[f99]) ).
fof(f203,plain,
~ ! [X0,X1,X2,X3] :
( X1 = X3
| s(X0,X3) != X2
| s(X0,X1) != X2 ),
inference(rectify,[],[f101]) ).
fof(f214,plain,
? [X0,X1,X2,X3] :
( X1 != X3
& s(X0,X3) = X2
& s(X0,X1) = X2 ),
inference(ennf_transformation,[],[f203]) ).
fof(f215,plain,
( ? [X0,X1,X2,X3] :
( X1 != X3
& s(X0,X3) = X2
& s(X0,X1) = X2 )
=> ( sK1 != sK3
& sK2 = s(sK0,sK3)
& sK2 = s(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f216,plain,
( sK1 != sK3
& sK2 = s(sK0,sK3)
& sK2 = s(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f214,f215]) ).
fof(f329,plain,
! [X0,X1] : s(X0,s(X0,X1)) = X1,
inference(cnf_transformation,[],[f202]) ).
fof(f330,plain,
sK2 = s(sK0,sK1),
inference(cnf_transformation,[],[f216]) ).
fof(f331,plain,
sK2 = s(sK0,sK3),
inference(cnf_transformation,[],[f216]) ).
fof(f332,plain,
sK1 != sK3,
inference(cnf_transformation,[],[f216]) ).
cnf(c_161,plain,
s(X0,s(X0,X1)) = X1,
inference(cnf_transformation,[],[f329]) ).
cnf(c_162,negated_conjecture,
sK1 != sK3,
inference(cnf_transformation,[],[f332]) ).
cnf(c_163,negated_conjecture,
s(sK0,sK3) = sK2,
inference(cnf_transformation,[],[f331]) ).
cnf(c_164,negated_conjecture,
s(sK0,sK1) = sK2,
inference(cnf_transformation,[],[f330]) ).
cnf(c_5382,plain,
s(sK0,sK2) = sK3,
inference(superposition,[status(thm)],[c_163,c_161]) ).
cnf(c_5383,plain,
s(sK0,sK2) = sK1,
inference(superposition,[status(thm)],[c_164,c_161]) ).
cnf(c_5384,plain,
sK1 = sK3,
inference(demodulation,[status(thm)],[c_5382,c_5383]) ).
cnf(c_5385,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5384,c_162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO498+1 : TPTP v8.1.2. Released v7.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n018.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 : Tue Aug 29 23:14:48 EDT 2023
% 0.20/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.34/1.16 % SZS status Started for theBenchmark.p
% 3.34/1.16 % SZS status Theorem for theBenchmark.p
% 3.34/1.16
% 3.34/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.34/1.16
% 3.34/1.16 ------ iProver source info
% 3.34/1.16
% 3.34/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.34/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.34/1.16 git: non_committed_changes: false
% 3.34/1.16 git: last_make_outside_of_git: false
% 3.34/1.16
% 3.34/1.16 ------ Parsing...
% 3.34/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.34/1.16
% 3.34/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.34/1.16
% 3.34/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.34/1.16
% 3.34/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.34/1.16 ------ Proving...
% 3.34/1.16 ------ Problem Properties
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16 clauses 124
% 3.34/1.16 conjectures 3
% 3.34/1.16 EPR 98
% 3.34/1.16 Horn 97
% 3.34/1.16 unary 26
% 3.34/1.16 binary 39
% 3.34/1.16 lits 351
% 3.34/1.16 lits eq 59
% 3.34/1.16 fd_pure 0
% 3.34/1.16 fd_pseudo 0
% 3.34/1.16 fd_cond 0
% 3.34/1.16 fd_pseudo_cond 31
% 3.34/1.16 AC symbols 0
% 3.34/1.16
% 3.34/1.16 ------ Schedule dynamic 5 is on
% 3.34/1.16
% 3.34/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16 ------
% 3.34/1.16 Current options:
% 3.34/1.16 ------
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16 ------ Proving...
% 3.34/1.16
% 3.34/1.16
% 3.34/1.16 % SZS status Theorem for theBenchmark.p
% 3.34/1.16
% 3.34/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.34/1.16
% 3.34/1.16
%------------------------------------------------------------------------------