TSTP Solution File: LCL677+1.010 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL677+1.010 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:49:36 EDT 2023
% Result : CounterSatisfiable 28.39s 4.72s
% Output : Model 28.39s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of r1
fof(lit_def,axiom,
! [X0,X1] :
( r1(X0,X1)
<=> ( ( X0 = sK64
& X1 = sK66 )
| ( X0 = sK64
& X1 = sK68 )
| ( X0 = sK64
& X1 = sK81 )
| ( X0 = sK64
& X1 = sK82 )
| ( X0 = sK64
& X1 = sK83 )
| ( X0 = sK64
& X1 = sK84 )
| ( X0 = sK64
& X1 = sK85 )
| ( X0 = sK64
& X1 = sK86 )
| ( X0 = sK64
& X1 = sK87 )
| ( X0 = sK64
& X1 = arAF0_sK67_0 )
| ( X0 = sK66
& X1 = sK68 )
| ( X0 = sK66
& X1 = arAF0_sK65_0 )
| ( X0 = sK66
& X1 = arAF0_sK67_0 )
| ( X0 = sK68
& X1 = sK68 )
| ( X0 = sK69
& X1 = sK71 )
| ( X0 = sK71
& X1 = sK71 )
| ( X0 = sK72
& X1 = sK73 )
| ( X0 = sK81
& X1 = sK81 )
| ( X0 = sK81
& X1 = arAF0_sK65_0 )
| ( X0 = sK82
& X1 = arAF0_sK65_0 )
| ( X0 = sK83
& X1 = arAF0_sK65_0 )
| ( X0 = sK87
& X1 = arAF0_sK65_0 )
| ( X0 = arAF0_sK65_0
& X1 = arAF0_sK65_0 )
| ( X0 = arAF0_sK22_0
& X1 = arAF0_sK22_0 )
| ( X0 = arAF0_sK67_0
& X1 = arAF0_sK67_0 )
| ( X1 = sK68
& X0 != sK68
& X0 != sK69
& X0 != sK71
& X0 != sK72
& X0 != sK73
& X0 != sK81
& X0 != sK82
& X0 != sK83
& X0 != sK85
& X0 != sK87
& X0 != arAF0_sK55_0
& X0 != arAF0_sK54_0
& X0 != arAF0_sK61_0
& X0 != arAF0_sK60_0
& X0 != arAF0_sK65_0
& X0 != arAF0_sK22_0
& X0 != arAF0_sK67_0 )
| ( X1 = arAF0_sK65_0
& X0 != sK66
& X0 != sK68
& X0 != sK69
& X0 != sK71
& X0 != sK72
& X0 != sK73
& X0 != sK81
& X0 != sK82
& X0 != sK83
& X0 != sK85
& X0 != sK87
& X0 != arAF0_sK55_0
& X0 != arAF0_sK54_0
& X0 != arAF0_sK61_0
& X0 != arAF0_sK60_0
& X0 != arAF0_sK65_0
& X0 != arAF0_sK22_0
& X0 != arAF0_sK67_0 )
| ( X1 = arAF0_sK67_0
& X0 != sK68
& X0 != sK69
& X0 != sK71
& X0 != sK72
& X0 != sK73
& X0 != sK81
& X0 != sK82
& X0 != sK83
& X0 != sK85
& X0 != sK87
& X0 != arAF0_sK55_0
& X0 != arAF0_sK54_0
& X0 != arAF0_sK61_0
& X0 != arAF0_sK60_0
& X0 != arAF0_sK65_0
& X0 != arAF0_sK22_0
& X0 != arAF0_sK67_0 ) ) ) ).
%------ Negative definition of p1
fof(lit_def_001,axiom,
! [X0] :
( ~ p1(X0)
<=> ( X0 = sK66
| X0 = sK69
| X0 = sK71
| X0 = sK72
| X0 = sK82
| X0 = arAF0_sK67_0 ) ) ).
%------ Positive definition of p2
fof(lit_def_002,axiom,
! [X0] :
( p2(X0)
<=> ( X0 = sK66
| X0 = sK68
| X0 = sK82
| X0 = sK85
| X0 = arAF0_sK67_0 ) ) ).
%------ Positive definition of p3
fof(lit_def_003,axiom,
! [X0] :
( p3(X0)
<=> ( X0 = sK87
| X0 = arAF0_sK65_0 ) ) ).
%------ Positive definition of p4
fof(lit_def_004,axiom,
! [X0] :
( p4(X0)
<=> $true ) ).
%------ Positive definition of sP20
fof(lit_def_005,axiom,
! [X0] :
( sP20(X0)
<=> $false ) ).
%------ Positive definition of sP19
fof(lit_def_006,axiom,
! [X0] :
( sP19(X0)
<=> $false ) ).
%------ Positive definition of sP18
fof(lit_def_007,axiom,
! [X0] :
( sP18(X0)
<=> $false ) ).
%------ Positive definition of sP17
fof(lit_def_008,axiom,
! [X0] :
( sP17(X0)
<=> $false ) ).
%------ Positive definition of sP16
fof(lit_def_009,axiom,
! [X0] :
( sP16(X0)
<=> $false ) ).
%------ Positive definition of sP13
fof(lit_def_010,axiom,
! [X0] :
( sP13(X0)
<=> $false ) ).
%------ Positive definition of sP15
fof(lit_def_011,axiom,
! [X0] :
( sP15(X0)
<=> $false ) ).
%------ Positive definition of sP14
fof(lit_def_012,axiom,
! [X0] :
( sP14(X0)
<=> $false ) ).
%------ Positive definition of sP10
fof(lit_def_013,axiom,
! [X0] :
( sP10(X0)
<=> $false ) ).
%------ Positive definition of sP12
fof(lit_def_014,axiom,
! [X0] :
( sP12(X0)
<=> $false ) ).
%------ Positive definition of sP11
fof(lit_def_015,axiom,
! [X0] :
( sP11(X0)
<=> $false ) ).
%------ Positive definition of sP6
fof(lit_def_016,axiom,
! [X0] :
( sP6(X0)
<=> $false ) ).
%------ Positive definition of sP9
fof(lit_def_017,axiom,
! [X0] :
( sP9(X0)
<=> $false ) ).
%------ Positive definition of sP7
fof(lit_def_018,axiom,
! [X0] :
( sP7(X0)
<=> $false ) ).
%------ Positive definition of sP8
fof(lit_def_019,axiom,
! [X0] :
( sP8(X0)
<=> $false ) ).
%------ Positive definition of arAF0_sP21_0
fof(lit_def_020,axiom,
( arAF0_sP21_0
<=> $false ) ).
%------ Positive definition of arAF0_sP5_0
fof(lit_def_021,axiom,
( arAF0_sP5_0
<=> $false ) ).
%------ Positive definition of arAF0_sP0_0
fof(lit_def_022,axiom,
( arAF0_sP0_0
<=> $false ) ).
%------ Positive definition of arAF0_sP4_0
fof(lit_def_023,axiom,
( arAF0_sP4_0
<=> $false ) ).
%------ Positive definition of arAF0_sP2_0
fof(lit_def_024,axiom,
( arAF0_sP2_0
<=> $false ) ).
%------ Positive definition of arAF0_sP3_0
fof(lit_def_025,axiom,
( arAF0_sP3_0
<=> $false ) ).
%------ Positive definition of arAF0_sP1_0
fof(lit_def_026,axiom,
( arAF0_sP1_0
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL677+1.010 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.17/0.36 % Computer : n008.cluster.edu
% 0.17/0.36 % Model : x86_64 x86_64
% 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36 % Memory : 8042.1875MB
% 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36 % CPULimit : 300
% 0.17/0.36 % WCLimit : 300
% 0.17/0.36 % DateTime : Fri Aug 25 07:01:17 EDT 2023
% 0.17/0.36 % CPUTime :
% 0.23/0.49 Running first-order theorem proving
% 0.23/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 28.39/4.72 % SZS status Started for theBenchmark.p
% 28.39/4.72 % SZS status CounterSatisfiable for theBenchmark.p
% 28.39/4.72
% 28.39/4.72 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 28.39/4.72
% 28.39/4.72 ------ iProver source info
% 28.39/4.72
% 28.39/4.72 git: date: 2023-05-31 18:12:56 +0000
% 28.39/4.72 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 28.39/4.72 git: non_committed_changes: false
% 28.39/4.72 git: last_make_outside_of_git: false
% 28.39/4.72
% 28.39/4.72 ------ Parsing...
% 28.39/4.72 ------ Clausification by vclausify_rel & Parsing by iProver...
% 28.39/4.72
% 28.39/4.72 ------ Preprocessing... sf_s rm: 123 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 28.39/4.72
% 28.39/4.72 ------ Preprocessing...
% 28.39/4.72 ------ Proving...
% 28.39/4.72 ------ Problem Properties
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 clauses 82
% 28.39/4.72 conjectures 38
% 28.39/4.72 EPR 38
% 28.39/4.72 Horn 32
% 28.39/4.72 unary 10
% 28.39/4.72 binary 10
% 28.39/4.72 lits 360
% 28.39/4.72 lits eq 0
% 28.39/4.72 fd_pure 0
% 28.39/4.72 fd_pseudo 0
% 28.39/4.72 fd_cond 0
% 28.39/4.72 fd_pseudo_cond 0
% 28.39/4.72 AC symbols 0
% 28.39/4.72
% 28.39/4.72 ------ Input Options Time Limit: Unbounded
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------
% 28.39/4.72 Current options:
% 28.39/4.72 ------
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 ------ Proving...
% 28.39/4.72
% 28.39/4.72
% 28.39/4.72 % SZS status CounterSatisfiable for theBenchmark.p
% 28.39/4.72
% 28.39/4.72 ------ Building Model...Done
% 28.39/4.72
% 28.39/4.72 %------ The model is defined over ground terms (initial term algebra).
% 28.39/4.72 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 28.39/4.72 %------ where \phi is a formula over the term algebra.
% 28.39/4.72 %------ If we have equality in the problem then it is also defined as a predicate above,
% 28.39/4.72 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 28.39/4.72 %------ See help for --sat_out_model for different model outputs.
% 28.39/4.72 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 28.39/4.72 %------ where the first argument stands for the sort ($i in the unsorted case)
% 28.39/4.72 % SZS output start Model for theBenchmark.p
% See solution above
% 28.39/4.73
%------------------------------------------------------------------------------