TSTP Solution File: LCL641+1.015 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL641+1.015 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.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:19 EDT 2023
% Result : CounterSatisfiable 11.96s 2.74s
% Output : Model 11.96s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of sP0
fof(lit_def,axiom,
! [X0] :
( sP0(X0)
<=> $false ) ).
%------ Positive definition of p1
fof(lit_def_001,axiom,
! [X0] :
( p1(X0)
<=> ( X0 = sK53
| X0 = sK49
| X0 = sK48
| X0 = sK47
| X0 = sK46
| X0 = sK45
| X0 = sK44
| X0 = sK43
| X0 = sK42
| X0 = sK41
| X0 = sK40
| X0 = sK39
| X0 = sK37
| X0 = sK36
| X0 = sK35 ) ) ).
%------ Positive definition of r1
fof(lit_def_002,axiom,
! [X0,X1] :
( r1(X0,X1)
<=> ( ( X0 = sK13
& X1 = sK35 )
| ( X0 = sK50
& X1 = sK53 )
| ( X0 = sK49
& X1 = sK50 )
| ( X0 = sK48
& X1 = sK49 )
| ( X0 = sK48
& X1 = sK68(sK48) )
| ( X0 = sK47
& X1 = sK48 )
| ( X0 = sK47
& X1 = sK65(sK47) )
| ( X0 = sK46
& X1 = sK47 )
| ( X0 = sK46
& X1 = sK62(sK46) )
| ( X0 = sK45
& X1 = sK46 )
| ( X0 = sK45
& X1 = sK59(sK45) )
| ( X0 = sK44
& X1 = sK45 )
| ( X0 = sK44
& X1 = sK56(sK44) )
| ( X0 = sK43
& X1 = sK44 )
| ( X0 = sK42
& X1 = sK43 )
| ( X0 = sK41
& X1 = sK42 )
| ( X0 = sK40
& X1 = sK41 )
| ( X0 = sK39
& X1 = sK40 )
| ( X0 = sK38
& X1 = sK39 )
| ( X0 = sK37
& X1 = sK38 )
| ( X0 = sK36
& X1 = sK37 )
| ( X0 = sK36
& X1 = sK14(sK36) )
| ( X0 = sK35
& X1 = sK36 )
| ( X0 = sK6(sK49)
& X1 = sK54(sK6(sK49)) )
| ( X0 = sK7(sK49)
& X1 = sK54(sK7(sK49)) )
| ( X0 = sK10(sK49)
& X1 = sK54(sK10(sK49)) )
| ( X0 = sK8(sK49)
& X1 = sK54(sK8(sK49)) )
| ( X0 = sK11(sK49)
& X1 = sK54(sK11(sK49)) ) ) ) ).
%------ Positive definition of sP3
fof(lit_def_003,axiom,
! [X0] :
( sP3(X0)
<=> X0 = sK50 ) ).
%------ Positive definition of sP2
fof(lit_def_004,axiom,
! [X0] :
( sP2(X0)
<=> X0 = sK50 ) ).
%------ Positive definition of sP1
fof(lit_def_005,axiom,
! [X0] :
( sP1(X0)
<=> X0 = sK50 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL641+1.015 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n014.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 : Thu Aug 24 22:04:18 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 11.96/2.74 % SZS status Started for theBenchmark.p
% 11.96/2.74 % SZS status CounterSatisfiable for theBenchmark.p
% 11.96/2.74
% 11.96/2.74 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 11.96/2.74
% 11.96/2.74 ------ iProver source info
% 11.96/2.74
% 11.96/2.74 git: date: 2023-05-31 18:12:56 +0000
% 11.96/2.74 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 11.96/2.74 git: non_committed_changes: false
% 11.96/2.74 git: last_make_outside_of_git: false
% 11.96/2.74
% 11.96/2.74 ------ Parsing...
% 11.96/2.74 ------ Clausification by vclausify_rel & Parsing by iProver...
% 11.96/2.74
% 11.96/2.74 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 11.96/2.74
% 11.96/2.74 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 11.96/2.74 ------ Proving...
% 11.96/2.74 ------ Problem Properties
% 11.96/2.74
% 11.96/2.74
% 11.96/2.74 clauses 155
% 11.96/2.74 conjectures 134
% 11.96/2.74 EPR 21
% 11.96/2.74 Horn 43
% 11.96/2.74 unary 18
% 11.96/2.74 binary 5
% 11.96/2.74 lits 1758
% 11.96/2.74 lits eq 0
% 11.96/2.74 fd_pure 0
% 11.96/2.74 fd_pseudo 0
% 11.96/2.74 fd_cond 0
% 11.96/2.74 fd_pseudo_cond 0
% 11.96/2.74 AC symbols 0
% 11.96/2.74
% 11.96/2.74 ------ Input Options Time Limit: Unbounded
% 11.96/2.74
% 11.96/2.74
% 11.96/2.74 ------
% 11.96/2.74 Current options:
% 11.96/2.74 ------
% 11.96/2.74
% 11.96/2.74
% 11.96/2.74
% 11.96/2.74
% 11.96/2.74 ------ Proving...
% 11.96/2.74
% 11.96/2.74
% 11.96/2.74 % SZS status CounterSatisfiable for theBenchmark.p
% 11.96/2.74
% 11.96/2.74 ------ Building Model...Done
% 11.96/2.74
% 11.96/2.74 %------ The model is defined over ground terms (initial term algebra).
% 11.96/2.74 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 11.96/2.74 %------ where \phi is a formula over the term algebra.
% 11.96/2.74 %------ If we have equality in the problem then it is also defined as a predicate above,
% 11.96/2.74 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 11.96/2.74 %------ See help for --sat_out_model for different model outputs.
% 11.96/2.74 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 11.96/2.74 %------ where the first argument stands for the sort ($i in the unsorted case)
% 11.96/2.74 % SZS output start Model for theBenchmark.p
% See solution above
% 11.96/2.74
%------------------------------------------------------------------------------