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