TSTP Solution File: NLP013+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NLP013+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:54:10 EDT 2023
% Result : CounterSatisfiable 3.31s 1.15s
% Output : Model 3.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP013+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 24 10:50:39 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.31/1.15 % SZS status Started for theBenchmark.p
% 3.31/1.15 % SZS status CounterSatisfiable for theBenchmark.p
% 3.31/1.15
% 3.31/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.31/1.15
% 3.31/1.15 ------ iProver source info
% 3.31/1.15
% 3.31/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.31/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.31/1.15 git: non_committed_changes: false
% 3.31/1.15 git: last_make_outside_of_git: false
% 3.31/1.15
% 3.31/1.15 ------ Parsing...
% 3.31/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_eq
% 3.31/1.15
% 3.31/1.15
% 3.31/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.31/1.15
% 3.31/1.15 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_eq
% 3.31/1.15 gs_s sp: 8 0s gs_e snvd_s sp: 0 0s snvd_e ------ preprocesses with Option_epr_non_horn_eq
% 3.31/1.15
% 3.31/1.15
% 3.31/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.31/1.15 ------ Proving...
% 3.31/1.15 ------ Problem Properties
% 3.31/1.15
% 3.31/1.15
% 3.31/1.15 clauses 67
% 3.31/1.15 conjectures 8
% 3.31/1.15 EPR 67
% 3.31/1.15 Horn 63
% 3.31/1.15 unary 0
% 3.31/1.15 binary 60
% 3.31/1.15 lits 186
% 3.31/1.15 lits eq 9
% 3.31/1.15 fd_pure 0
% 3.31/1.15 fd_pseudo 0
% 3.31/1.15 fd_cond 0
% 3.31/1.15 fd_pseudo_cond 3
% 3.31/1.15 AC symbols 0
% 3.31/1.15
% 3.31/1.15 ------ Schedule EPR non Horn eq is on
% 3.31/1.15
% 3.31/1.15 ------ Option_epr_non_horn_eq Time Limit: Unbounded
% 3.31/1.15
% 3.31/1.15
% 3.31/1.15 ------
% 3.31/1.15 Current options:
% 3.31/1.15 ------
% 3.31/1.15
% 3.31/1.15
% 3.31/1.15
% 3.31/1.15
% 3.31/1.15 ------ Proving...
% 3.31/1.15
% 3.31/1.15
% 3.31/1.15 % SZS status CounterSatisfiable for theBenchmark.p
% 3.31/1.15
% 3.31/1.15 ------ Building Model...Done
% 3.31/1.15
% 3.31/1.15 %------ The model is defined over ground terms (initial term algebra).
% 3.31/1.15 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.31/1.15 %------ where \phi is a formula over the term algebra.
% 3.31/1.15 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.31/1.15 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.31/1.15 %------ See help for --sat_out_model for different model outputs.
% 3.31/1.15 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.31/1.15 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.31/1.15 % SZS output start Model for theBenchmark.p
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of equality_sorted
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_12,X0_1,X1_1] :
% 3.31/1.15 ( equality_sorted(X0_12,X0_1,X1_1) <=>
% 3.31/1.15 (
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=$o & X1_1=X0_1 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK11 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK8 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK8 | X1_13!=sK7 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK10 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK7 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK4 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK20 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK17 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK17 | X1_13!=sK16 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK16 | X1_13!=sK20 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK16 | X1_13!=sK17 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK13 )
% 3.31/1.15 &
% 3.31/1.15 ( X1_13!=sK11 )
% 3.31/1.15 &
% 3.31/1.15 ( X1_13!=sK8 )
% 3.31/1.15 &
% 3.31/1.15 ( X1_13!=sK10 )
% 3.31/1.15 &
% 3.31/1.15 ( X1_13!=sK7 )
% 3.31/1.15 &
% 3.31/1.15 ( X1_13!=sK4 )
% 3.31/1.15 &
% 3.31/1.15 ( X1_13!=sK20 )
% 3.31/1.15 &
% 3.31/1.15 ( X1_13!=sK17 )
% 3.31/1.15 &
% 3.31/1.15 ( X1_13!=sK13 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK11 & X1_13=sK11 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK11 & X1_13=sK8 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK8 & X1_13=sK11 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK8 & X1_13=sK8 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK10 & X1_13=sK10 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK10 & X1_13=sK7 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK7 & X1_13=sK10 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK7 & X1_13=sK7 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK4 & X1_13=sK4 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK20 & X1_13=sK20 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK20 & X1_13=sK17 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK17 & X1_13=sK20 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK17 & X1_13=sK17 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK19 & X1_13=sK16 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X0_13=sK13 & X1_13=sK13 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_12=iProver_down_1_$i & X1_13=X0_13 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK11 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK8 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK10 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK7 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK4 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK20 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK17 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK13 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of in
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_13,X0_14] :
% 3.31/1.15 ( in(X0_13,X0_14) <=>
% 3.31/1.15 (
% 3.31/1.15 (
% 3.31/1.15 ( X0_13!=sK17 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_13!=sK16 | X0_14!=sK2 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_14!=sK2 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_14!=sK9 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK11 & X0_14=sK2 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK8 & X0_14=sK2 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK10 & X0_14=sK9 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK7 & X0_14=sK9 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK4 & X0_14=sK3 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK20 & X0_14=sK18 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK17 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_14!=sK2 )
% 3.31/1.15 &
% 3.31/1.15 ( X0_14!=sK9 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK19 & X0_14=sK18 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK13 & X0_14=sK12 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of sP1
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 ( sP1 <=>
% 3.31/1.15 $true
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of young
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_13] :
% 3.31/1.15 ( ~(young(X0_13)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of man
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_13] :
% 3.31/1.15 ( ~(man(X0_13)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of fellow
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_13] :
% 3.31/1.15 ( ~(fellow(X0_13)) <=>
% 3.31/1.15 (
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK4 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK13 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of front
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_14] :
% 3.31/1.15 ( ~(front(X0_14)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of furniture
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_14] :
% 3.31/1.15 ( ~(furniture(X0_14)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of seat
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_14] :
% 3.31/1.15 ( seat(X0_14) <=>
% 3.31/1.15 (
% 3.31/1.15 (
% 3.31/1.15 ( X0_14=sK2 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_14=sK9 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of down
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_13,X0_15] :
% 3.31/1.15 ( down(X0_13,X0_15) <=>
% 3.31/1.15 (
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK4 & X0_15=sK5 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK13 & X0_15=sK15 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of barrel
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_13,X0_16] :
% 3.31/1.15 ( barrel(X0_13,X0_16) <=>
% 3.31/1.15 (
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK4 & X0_16=sK6 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK13 & X0_16=sK14 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of old
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_16] :
% 3.31/1.15 ( ~(old(X0_16)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of dirty
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_16] :
% 3.31/1.15 ( ~(dirty(X0_16)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of white
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_16] :
% 3.31/1.15 ( ~(white(X0_16)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of car
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_16] :
% 3.31/1.15 ( ~(car(X0_16)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of chevy
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_16] :
% 3.31/1.15 ( ~(chevy(X0_16)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of lonely
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_15] :
% 3.31/1.15 ( ~(lonely(X0_15)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of way
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_15] :
% 3.31/1.15 ( ~(way(X0_15)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of street
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_15] :
% 3.31/1.15 ( ~(street(X0_15)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of event
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_13] :
% 3.31/1.15 ( event(X0_13) <=>
% 3.31/1.15 (
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK4 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_13=sK13 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Negative definition of city
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_14] :
% 3.31/1.15 ( ~(city(X0_14)) <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of hollywood
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 (! [X0_14] :
% 3.31/1.15 ( hollywood(X0_14) <=>
% 3.31/1.15 (
% 3.31/1.15 (
% 3.31/1.15 ( X0_14=sK3 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 |
% 3.31/1.15 (
% 3.31/1.15 ( X0_14=sK12 )
% 3.31/1.15 )
% 3.31/1.15
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of sP0
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 ( sP0 <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of sP0_iProver_split
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 ( sP0_iProver_split <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of sP1_iProver_split
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 ( sP1_iProver_split <=>
% 3.31/1.15 $true
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of sP2_iProver_split
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 ( sP2_iProver_split <=>
% 3.31/1.15 $false
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15
% 3.31/1.15 %------ Positive definition of sP3_iProver_split
% 3.31/1.15 fof(lit_def,axiom,
% 3.31/1.15 ( sP3_iProver_split <=>
% 3.31/1.15 $true
% 3.31/1.15 )
% 3.31/1.15 ).
% 3.31/1.15 % SZS output end Model for theBenchmark.p
% 3.31/1.16
%------------------------------------------------------------------------------