TSTP Solution File: LCL651+1.001 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL651+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 : Thu Aug 31 07:46:40 EDT 2023
% Result : CounterSatisfiable 2.21s 1.18s
% Output : Model 2.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of p1
fof(lit_def,axiom,
! [X0] :
( p1(X0)
<=> ( X0 = sK7
| X0 = sK15 ) ) ).
%------ Positive definition of p2
fof(lit_def_001,axiom,
! [X0] :
( p2(X0)
<=> $false ) ).
%------ Positive definition of r1
fof(lit_def_002,axiom,
! [X0,X1] :
( r1(X0,X1)
<=> ( ( X0 = sK6
& X1 = sK7 )
| ( X0 = sK5
& X1 = sK6 )
| ( X0 = sK5
& X1 = sK1(sK5) )
| ( X0 = sK4
& X1 = sK5 )
| ( X0 = sK4
& X1 = sK8(sK4) )
| ( X0 = sK3
& X1 = sK4 )
| ( X0 = sK3
& X1 = sK9(sK3) )
| ( X0 = sK2
& X1 = sK3 )
| ( X0 = sK2
& X1 = sK10 )
| ( X0 = sK2
& X1 = sK11 )
| ( X0 = sK10
& X1 = sK9(sK10) )
| ( X0 = sK14
& X1 = sK15 )
| ( X0 = sK13
& X1 = sK14 )
| ( X0 = sK13
& X1 = sK1(sK13) )
| ( X0 = sK12
& X1 = sK13 )
| ( X0 = sK12
& X1 = sK8(sK12) )
| ( X0 = sK11
& X1 = sK12 )
| ( X0 = sK11
& X1 = sK9(sK11) )
| ( X0 = sK9(sK3)
& X1 = sK8(sK9(sK3)) )
| ( X0 = sK9(sK10)
& X1 = sK8(sK9(sK10)) )
| ( X0 = sK9(sK11)
& X1 = sK8(sK9(sK11)) )
| ( X0 = sK8(sK4)
& X1 = sK1(sK8(sK4)) )
| ( X0 = sK8(sK9(sK3))
& X1 = sK1(sK8(sK9(sK3))) )
| ( X0 = sK8(sK9(sK10))
& X1 = sK1(sK8(sK9(sK10))) )
| ( X0 = sK8(sK12)
& X1 = sK1(sK8(sK12)) )
| ( X0 = sK8(sK9(sK11))
& X1 = sK1(sK8(sK9(sK11))) ) ) ) ).
%------ Positive definition of sP0
fof(lit_def_003,axiom,
! [X0] :
( sP0(X0)
<=> ( X0 = sK4
| X0 = sK12
| X0 = sK9(sK3)
| X0 = sK9(sK10)
| X0 = sK9(sK11) ) ) ).
%------ Positive definition of p3
fof(lit_def_004,axiom,
! [X0] :
( p3(X0)
<=> ( X0 = sK7
| X0 = sK15 ) ) ).
%------ Positive definition of p4
fof(lit_def_005,axiom,
! [X0] :
( p4(X0)
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL651+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 24 17:14:02 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.23/0.49 Running first-order theorem proving
% 0.23/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.21/1.18 % SZS status Started for theBenchmark.p
% 2.21/1.18 % SZS status CounterSatisfiable for theBenchmark.p
% 2.21/1.18
% 2.21/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.21/1.18
% 2.21/1.18 ------ iProver source info
% 2.21/1.18
% 2.21/1.18 git: date: 2023-05-31 18:12:56 +0000
% 2.21/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.21/1.18 git: non_committed_changes: false
% 2.21/1.18 git: last_make_outside_of_git: false
% 2.21/1.18
% 2.21/1.18 ------ Parsing...
% 2.21/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.21/1.18
% 2.21/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.21/1.18
% 2.21/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.21/1.18 ------ Proving...
% 2.21/1.18 ------ Problem Properties
% 2.21/1.18
% 2.21/1.18
% 2.21/1.18 clauses 25
% 2.21/1.18 conjectures 19
% 2.21/1.18 EPR 20
% 2.21/1.18 Horn 21
% 2.21/1.18 unary 11
% 2.21/1.18 binary 1
% 2.21/1.18 lits 80
% 2.21/1.18 lits eq 0
% 2.21/1.18 fd_pure 0
% 2.21/1.18 fd_pseudo 0
% 2.21/1.18 fd_cond 0
% 2.21/1.18 fd_pseudo_cond 0
% 2.21/1.18 AC symbols 0
% 2.21/1.18
% 2.21/1.18 ------ Schedule dynamic 5 is on
% 2.21/1.18
% 2.21/1.18 ------ no equalities: superposition off
% 2.21/1.18
% 2.21/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.21/1.18
% 2.21/1.18
% 2.21/1.18 ------
% 2.21/1.18 Current options:
% 2.21/1.18 ------
% 2.21/1.18
% 2.21/1.18
% 2.21/1.18
% 2.21/1.18
% 2.21/1.18 ------ Proving...
% 2.21/1.18
% 2.21/1.18
% 2.21/1.18 % SZS status CounterSatisfiable for theBenchmark.p
% 2.21/1.18
% 2.21/1.18 ------ Building Model...Done
% 2.21/1.18
% 2.21/1.18 %------ The model is defined over ground terms (initial term algebra).
% 2.21/1.18 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.21/1.18 %------ where \phi is a formula over the term algebra.
% 2.21/1.18 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.21/1.18 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.21/1.18 %------ See help for --sat_out_model for different model outputs.
% 2.21/1.18 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.21/1.18 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.21/1.18 % SZS output start Model for theBenchmark.p
% See solution above
% 2.21/1.18
%------------------------------------------------------------------------------