TSTP Solution File: SYN725+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN725+1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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 Sep 1 03:09:35 EDT 2023
% Result : CounterSatisfiable 1.11s 1.17s
% Output : Saturation 1.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( ( s(X0)
<=> ( s(X0)
& r(X0) ) )
| r(X0) )
=> ! [X0] :
( r(X0)
=> s(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm39) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ( s(X0)
<=> ( s(X0)
& r(X0) ) )
| r(X0) )
=> ! [X0] :
( r(X0)
=> s(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ! [X0] :
( ( s(X0)
<=> ( s(X0)
& r(X0) ) )
| r(X0) )
=> ! [X1] :
( r(X1)
=> s(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X1] :
( ~ s(X1)
& r(X1) )
& ! [X0] :
( ( s(X0)
<=> ( s(X0)
& r(X0) ) )
| r(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X1] :
( ~ s(X1)
& r(X1) )
& ! [X0] :
( ( ( s(X0)
| ~ s(X0)
| ~ r(X0) )
& ( ( s(X0)
& r(X0) )
| ~ s(X0) ) )
| r(X0) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ? [X1] :
( ~ s(X1)
& r(X1) )
& ! [X0] :
( ( ( s(X0)
| ~ s(X0)
| ~ r(X0) )
& ( ( s(X0)
& r(X0) )
| ~ s(X0) ) )
| r(X0) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ? [X0] :
( ~ s(X0)
& r(X0) )
& ! [X1] :
( ( ( s(X1)
| ~ s(X1)
| ~ r(X1) )
& ( ( s(X1)
& r(X1) )
| ~ s(X1) ) )
| r(X1) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ? [X0] :
( ~ s(X0)
& r(X0) )
=> ( ~ s(sK0)
& r(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ~ s(sK0)
& r(sK0)
& ! [X1] :
( ( ( s(X1)
| ~ s(X1)
| ~ r(X1) )
& ( ( s(X1)
& r(X1) )
| ~ s(X1) ) )
| r(X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
fof(f13,plain,
r(sK0),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
~ s(sK0),
inference(cnf_transformation,[],[f9]) ).
cnf(c_49,negated_conjecture,
~ s(sK0),
inference(cnf_transformation,[],[f14]) ).
cnf(c_50,negated_conjecture,
r(sK0),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN725+1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n025.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 : 300
% 0.12/0.33 % DateTime : Sat Aug 26 21:24:23 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.11/1.17 % SZS status Started for theBenchmark.p
% 1.11/1.17 % SZS status CounterSatisfiable for theBenchmark.p
% 1.11/1.17
% 1.11/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.11/1.17
% 1.11/1.17 ------ iProver source info
% 1.11/1.17
% 1.11/1.17 git: date: 2023-05-31 18:12:56 +0000
% 1.11/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.11/1.17 git: non_committed_changes: false
% 1.11/1.17 git: last_make_outside_of_git: false
% 1.11/1.17
% 1.11/1.17 ------ Parsing...
% 1.11/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_horn
% 1.11/1.17
% 1.11/1.17
% 1.11/1.17 ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 1.11/1.17
% 1.11/1.17 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.11/1.17 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.11/1.17 ------ Proving...
% 1.11/1.17 ------ Problem Properties
% 1.11/1.17
% 1.11/1.17
% 1.11/1.17 clauses 0
% 1.11/1.17 conjectures 0
% 1.11/1.17 EPR 0
% 1.11/1.17 Horn 0
% 1.11/1.17 unary 0
% 1.11/1.17 binary 0
% 1.11/1.17 lits 0
% 1.11/1.17 lits eq 0
% 1.11/1.17 fd_pure 0
% 1.11/1.17 fd_pseudo 0
% 1.11/1.17 fd_cond 0
% 1.11/1.17 fd_pseudo_cond 0
% 1.11/1.17 AC symbols 0
% 1.11/1.17
% 1.11/1.17 ------ Schedule EPR Horn non eq is on
% 1.11/1.17
% 1.11/1.17 ------ no conjectures: strip conj schedule
% 1.11/1.17
% 1.11/1.17 ------ no equalities: superposition off
% 1.11/1.17
% 1.11/1.17 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 1.11/1.17
% 1.11/1.17
% 1.11/1.17
% 1.11/1.17
% 1.11/1.17 % SZS status CounterSatisfiable for theBenchmark.p
% 1.11/1.17
% 1.11/1.17 % SZS output start Saturation for theBenchmark.p
% See solution above
% 1.11/1.17
% 1.11/1.17
%------------------------------------------------------------------------------