TSTP Solution File: MSC013+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MSC013+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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 09:26:11 EDT 2023
% Result : CounterSatisfiable 1.13s 1.22s
% Output : Model 1.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Negative definition of equalish
fof(lit_def,axiom,
! [X0,X1] :
( ~ equalish(X0,X1)
<=> ( ( X0 = n1
& X1 = n0 )
| ( X0 = n0
& X1 = n1 ) ) ) ).
%------ Positive definition of goal
fof(lit_def_001,axiom,
( goal
<=> $false ) ).
%------ Positive definition of f
fof(lit_def_002,axiom,
! [X0,X1,X2,X3,X4,X5] :
( f(X0,X1,X2,X3,X4,X5)
<=> ( ( X0 = n1
& X1 = n1
& X5 = sK0(n1,n1,X2,X3,X4) )
| ( X0 = n1
& X1 = n0
& X5 = sK0(n1,n0,X2,X3,X4) )
| ( X0 = n1
& X2 = n1
& X5 = sK0(n1,X1,n1,X3,X4) )
| ( X0 = n1
& X2 = n0
& X5 = sK0(n1,X1,n0,X3,X4) )
| ( X0 = n1
& X3 = n1
& X5 = sK0(n1,X1,X2,n1,X4) )
| ( X0 = n1
& X3 = n0
& X5 = sK0(n1,X1,X2,n0,X4) )
| ( X0 = n1
& X4 = n1
& X5 = sK0(n1,X1,X2,X3,n1) )
| ( X0 = n1
& X4 = n0
& X5 = sK0(n1,X1,X2,X3,n0) )
| ( X0 = n1
& X5 = sK0(n1,X1,X2,X3,X4)
& X1 != n1
& X1 != n0
& X2 != n1
& X2 != n0
& X3 != n1
& X3 != n0
& X4 != n1
& X4 != n0 )
| ( X1 = n1
& X5 = sK0(X0,n1,X2,X3,X4)
& X0 != n1 )
| ( X1 = n0
& X5 = sK0(X0,n0,X2,X3,X4)
& X0 != n1 )
| ( X2 = n1
& X5 = sK0(X0,X1,n1,X3,X4)
& X0 != n1 )
| ( X2 = n0
& X5 = sK0(X0,X1,n0,X3,X4)
& X0 != n1 )
| ( X3 = n1
& X5 = sK0(X0,X1,X2,n1,X4)
& X0 != n1 )
| ( X3 = n0
& X5 = sK0(X0,X1,X2,n0,X4)
& X0 != n1 )
| ( X4 = n1
& X5 = sK0(X0,X1,X2,X3,n1)
& X0 != n1 )
| ( X4 = n0
& X5 = sK0(X0,X1,X2,X3,n0)
& X0 != n1 )
| ( X5 = sK0(X0,X1,X2,X3,X4)
& X0 != n1
& X1 != n1
& X1 != n0
& X2 != n1
& X2 != n0
& X3 != n1
& X3 != n0
& X4 != n1
& X4 != n0 ) ) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MSC013+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 13:36:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.13/1.22 % SZS status Started for theBenchmark.p
% 1.13/1.22 % SZS status CounterSatisfiable for theBenchmark.p
% 1.13/1.22
% 1.13/1.22 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.13/1.22
% 1.13/1.22 ------ iProver source info
% 1.13/1.22
% 1.13/1.22 git: date: 2023-05-31 18:12:56 +0000
% 1.13/1.22 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.13/1.22 git: non_committed_changes: false
% 1.13/1.22 git: last_make_outside_of_git: false
% 1.13/1.22
% 1.13/1.22 ------ Parsing...
% 1.13/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.13/1.22
% 1.13/1.22 ------ Preprocessing... sf_s rm: 1 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.13/1.22
% 1.13/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.13/1.22 ------ Proving...
% 1.13/1.22 ------ Problem Properties
% 1.13/1.22
% 1.13/1.22
% 1.13/1.22 clauses 10
% 1.13/1.22 conjectures 0
% 1.13/1.22 EPR 9
% 1.13/1.22 Horn 10
% 1.13/1.22 unary 4
% 1.13/1.22 binary 0
% 1.13/1.22 lits 25
% 1.13/1.22 lits eq 0
% 1.13/1.22 fd_pure 0
% 1.13/1.22 fd_pseudo 0
% 1.13/1.22 fd_cond 0
% 1.13/1.22 fd_pseudo_cond 0
% 1.13/1.22 AC symbols 0
% 1.13/1.22
% 1.13/1.22 ------ Schedule dynamic 5 is on
% 1.13/1.22
% 1.13/1.22 ------ no conjectures: strip conj schedule
% 1.13/1.22
% 1.13/1.22 ------ no equalities: superposition off
% 1.13/1.22
% 1.13/1.22 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.13/1.22
% 1.13/1.22
% 1.13/1.22 ------
% 1.13/1.22 Current options:
% 1.13/1.22 ------
% 1.13/1.22
% 1.13/1.22
% 1.13/1.22
% 1.13/1.22
% 1.13/1.22 ------ Proving...
% 1.13/1.22
% 1.13/1.22
% 1.13/1.22 % SZS status CounterSatisfiable for theBenchmark.p
% 1.13/1.22
% 1.13/1.22 ------ Building Model...Done
% 1.13/1.22
% 1.13/1.22 %------ The model is defined over ground terms (initial term algebra).
% 1.13/1.22 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.13/1.22 %------ where \phi is a formula over the term algebra.
% 1.13/1.22 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.13/1.22 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.13/1.22 %------ See help for --sat_out_model for different model outputs.
% 1.13/1.22 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.13/1.22 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.13/1.22 % SZS output start Model for theBenchmark.p
% See solution above
% 1.13/1.22
%------------------------------------------------------------------------------