TSTP Solution File: NLP217+1 by iProver-SAT---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver-SAT---3.8
% Problem : NLP217+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d SAT
% Computer : n018.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:58:59 EDT 2023
% Result : CounterSatisfiable 3.73s 1.15s
% Output : Model 3.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP217+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d SAT
% 0.13/0.34 % Computer : n018.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 11:51:57 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.45 Running model finding
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --heuristic_context fnt --schedule fnt_schedule /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.73/1.15 % SZS status Started for theBenchmark.p
% 3.73/1.15 ERROR - "ProverProcess:heur/fnt_2:300.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel prover was killed by a signal: -10")
% 3.73/1.15 Fatal error: exception Failure("Clausification error: res/vclausify_rel prover was killed by a signal: -10")
% 3.73/1.15 ERROR - cmd was: ulimit -v 4096000; ./res/iproveropt_static_z3 --out_options none --sub_typing false --suppress_unsat_res true --preprocessing_flag true --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 300.00" --time_out_real 300.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_669e8di1/h0pv096c 2>> /export/starexec/sandbox/tmp/iprover_out_669e8di1/h0pv096c_error
% 3.73/1.15 % SZS status CounterSatisfiable for theBenchmark.p
% 3.73/1.15
% 3.73/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.73/1.15
% 3.73/1.15 ------ iProver source info
% 3.73/1.15
% 3.73/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.73/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.73/1.15 git: non_committed_changes: false
% 3.73/1.15 git: last_make_outside_of_git: false
% 3.73/1.15
% 3.73/1.15 ------ Parsing...
% 3.73/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.73/1.15
% 3.73/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe:32:0s pe_e sup_sim: 0 sf_s rm: 20 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 21 0s sf_e pe_s pe_e
% 3.73/1.15
% 3.73/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.73/1.15
% 3.73/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.73/1.15 ------ Proving...
% 3.73/1.15 ------ Problem Properties
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 clauses 48
% 3.73/1.15 conjectures 3
% 3.73/1.15 EPR 38
% 3.73/1.15 Horn 44
% 3.73/1.15 unary 24
% 3.73/1.15 binary 15
% 3.73/1.15 lits 98
% 3.73/1.15 lits eq 17
% 3.73/1.15 fd_pure 0
% 3.73/1.15 fd_pseudo 0
% 3.73/1.15 fd_cond 0
% 3.73/1.15 fd_pseudo_cond 8
% 3.73/1.15 AC symbols 0
% 3.73/1.15
% 3.73/1.15 ------ Input Options Time Limit: Unbounded
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Finite Models:
% 3.73/1.15
% 3.73/1.15 ------ lit_activity_flag true
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 1
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 2
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 2
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 2
% 3.73/1.15 ------
% 3.73/1.15 Current options:
% 3.73/1.15 ------
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 2
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 2
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 3
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 3
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 4
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 4
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 4
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 4
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 4
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 4
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 5
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 5
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 5
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 6
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 6
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 6
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 6
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 7
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 7
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 7
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 7
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15 ------ Trying domains of size >= : 7
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 ------ Proving...
% 3.73/1.15
% 3.73/1.15
% 3.73/1.15 % SZS status CounterSatisfiable for theBenchmark.p
% 3.73/1.15
% 3.73/1.15 ------ Building Model...Done
% 3.73/1.15
% 3.73/1.15 %------ The model is defined over ground terms (initial term algebra).
% 3.73/1.15 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.73/1.15 %------ where \phi is a formula over the term algebra.
% 3.73/1.15 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.73/1.15 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.73/1.16 %------ See help for --sat_out_model for different model outputs.
% 3.73/1.16 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.73/1.16 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.73/1.16 % SZS output start Model for theBenchmark.p
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of equality_sorted
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0_12,X0_1,X1_1] :
% 3.73/1.16 ( equality_sorted(X0_12,X0_1,X1_1) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0_12=$o & X1_1=X0_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X0_12=$i & X0=iProver_Domain_i_3 & X1=iProver_Domain_i_3 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X0_12=$i & X0=iProver_Domain_i_5 & X1=iProver_Domain_i_5 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X0_12=$i & X0=iProver_Domain_i_6 & X1=iProver_Domain_i_6 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of frontseat
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( frontseat(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of city
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( city(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of placename
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( placename(X0,X1) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_5 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of hollywood_placename
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( hollywood_placename(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of chevy
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( chevy(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of street
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( street(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of event
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( event(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of barrel
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( barrel(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of group
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( group(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of two
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( two(X0,X1) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of fellow
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( fellow(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of wear
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( wear(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of coat
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( coat(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of eventuality
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( eventuality(X0,X1) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_1 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_1 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_2 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_3 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_4 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_5 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_6 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of state
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( state(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of black
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( black(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of white
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( white(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of old
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( old(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of young
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( young(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of of
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1,X2] :
% 3.73/1.16 ( of(X0,X1,X2) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_5 & X2=iProver_Domain_i_4 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of member
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1,X2] :
% 3.73/1.16 ( member(X0,X1,X2) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_3 & X2=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_1 & X1=iProver_Domain_i_6 & X2=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of patient
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1,X2] :
% 3.73/1.16 ( patient(X0,X1,X2) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of agent
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1,X2] :
% 3.73/1.16 ( agent(X0,X1,X2) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of nonreflexive
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( nonreflexive(X0,X1) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of be
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1,X2,X3] :
% 3.73/1.16 ( be(X0,X1,X2,X3) <=>
% 3.73/1.16 $false
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Negative definition of iProver_Flat_sK0
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1,X2,X3,X4] :
% 3.73/1.16 ( ~(iProver_Flat_sK0(X0,X1,X2,X3,X4)) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 & X3=X0 & X4=iProver_Domain_i_3 )
% 3.73/1.16 &
% 3.73/1.16 ( X0!=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 & X3=X0 & X4=iProver_Domain_i_6 )
% 3.73/1.16 &
% 3.73/1.16 ( X0!=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 & X3=iProver_Domain_i_3 & X4=X0 )
% 3.73/1.16 &
% 3.73/1.16 ( X0!=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 & X3=iProver_Domain_i_6 & X4=X0 )
% 3.73/1.16 &
% 3.73/1.16 ( X0!=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 & X4=iProver_Domain_i_3 )
% 3.73/1.16 &
% 3.73/1.16 ( X0!=iProver_Domain_i_1 )
% 3.73/1.16 &
% 3.73/1.16 ( X0!=iProver_Domain_i_1 | X3!=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 & X4=iProver_Domain_i_6 )
% 3.73/1.16 &
% 3.73/1.16 ( X0!=iProver_Domain_i_1 )
% 3.73/1.16 &
% 3.73/1.16 ( X0!=iProver_Domain_i_1 | X3!=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK1
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1,X2] :
% 3.73/1.16 ( iProver_Flat_sK1(X0,X1,X2) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_1 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_1 | X2!=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_3 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK2
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1,X2] :
% 3.73/1.16 ( iProver_Flat_sK2(X0,X1,X2) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_5 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_1 | X2!=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_6 & X1=iProver_Domain_i_1 & X2=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK3
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0] :
% 3.73/1.16 ( iProver_Flat_sK3(X0) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK9
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0] :
% 3.73/1.16 ( iProver_Flat_sK9(X0) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_2 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Negative definition of iProver_Flat_sK10
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1,X2] :
% 3.73/1.16 ( ~(iProver_Flat_sK10(X0,X1,X2)) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X2=iProver_Domain_i_3 )
% 3.73/1.16 &
% 3.73/1.16 ( X0!=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X2=iProver_Domain_i_6 )
% 3.73/1.16 &
% 3.73/1.16 ( X0!=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK8
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0] :
% 3.73/1.16 ( iProver_Flat_sK8(X0) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_1 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK11
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( iProver_Flat_sK11(X0,X1) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_2 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_3 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_6 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_7 & X1=iProver_Domain_i_3 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_7 & X1=iProver_Domain_i_6 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK12
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0,X1] :
% 3.73/1.16 ( iProver_Flat_sK12(X0,X1) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_1 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_3 )
% 3.73/1.16 &
% 3.73/1.16 ( X1!=iProver_Domain_i_6 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_3 & X1=iProver_Domain_i_3 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 |
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_6 & X1=iProver_Domain_i_6 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK7
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0] :
% 3.73/1.16 ( iProver_Flat_sK7(X0) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_7 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK4
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0] :
% 3.73/1.16 ( iProver_Flat_sK4(X0) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_4 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK6
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0] :
% 3.73/1.16 ( iProver_Flat_sK6(X0) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_4 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16
% 3.73/1.16 %------ Positive definition of iProver_Flat_sK5
% 3.73/1.16 fof(lit_def,axiom,
% 3.73/1.16 (! [X0] :
% 3.73/1.16 ( iProver_Flat_sK5(X0) <=>
% 3.73/1.16 (
% 3.73/1.16 (
% 3.73/1.16 ( X0=iProver_Domain_i_5 )
% 3.73/1.16 )
% 3.73/1.16
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 )
% 3.73/1.16 ).
% 3.73/1.16 % SZS output end Model for theBenchmark.p
% 3.73/1.16 ------ Statistics
% 3.73/1.16
% 3.73/1.16 ------ Problem properties
% 3.73/1.16
% 3.73/1.16 clauses: 48
% 3.73/1.16 conjectures: 3
% 3.73/1.16 epr: 38
% 3.73/1.16 horn: 44
% 3.73/1.16 ground: 23
% 3.73/1.16 unary: 24
% 3.73/1.16 binary: 15
% 3.73/1.16 lits: 98
% 3.73/1.16 lits_eq: 17
% 3.73/1.16 fd_pure: 0
% 3.73/1.16 fd_pseudo: 0
% 3.73/1.16 fd_cond: 0
% 3.73/1.16 fd_pseudo_cond: 8
% 3.73/1.16 ac_symbols: 0
% 3.73/1.16
% 3.73/1.16 ------ General
% 3.73/1.16
% 3.73/1.16 abstr_ref_over_cycles: 0
% 3.73/1.16 abstr_ref_under_cycles: 0
% 3.73/1.16 gc_basic_clause_elim: 0
% 3.73/1.16 num_of_symbols: 242
% 3.73/1.16 num_of_terms: 4216
% 3.73/1.16
% 3.73/1.16 parsing_time: 0.019
% 3.73/1.16 unif_index_cands_time: 0.007
% 3.73/1.16 unif_index_add_time: 0.005
% 3.73/1.16 orderings_time: 0.
% 3.73/1.16 out_proof_time: 0.
% 3.73/1.16 total_time: 0.396
% 3.73/1.16
% 3.73/1.16 ------ Preprocessing
% 3.73/1.16
% 3.73/1.16 num_of_splits: 0
% 3.73/1.16 num_of_split_atoms: 0
% 3.73/1.16 num_of_reused_defs: 0
% 3.73/1.16 num_eq_ax_congr_red: 122
% 3.73/1.16 num_of_sem_filtered_clauses: 1
% 3.73/1.16 num_of_subtypes: 0
% 3.73/1.16 monotx_restored_types: 0
% 3.73/1.16 sat_num_of_epr_types: 0
% 3.73/1.16 sat_num_of_non_cyclic_types: 0
% 3.73/1.16 sat_guarded_non_collapsed_types: 0
% 3.73/1.16 num_pure_diseq_elim: 0
% 3.73/1.16 simp_replaced_by: 0
% 3.73/1.16 res_preprocessed: 0
% 3.73/1.16 sup_preprocessed: 0
% 3.73/1.16 prep_upred: 0
% 3.73/1.16 prep_unflattend: 497
% 3.73/1.16 prep_well_definedness: 0
% 3.73/1.16 smt_new_axioms: 0
% 3.73/1.16 pred_elim_cands: 5
% 3.73/1.16 pred_elim: 53
% 3.73/1.16 pred_elim_cl: 48
% 3.73/1.16 pred_elim_cycles: 61
% 3.73/1.16 merged_defs: 0
% 3.73/1.16 merged_defs_ncl: 0
% 3.73/1.16 bin_hyper_res: 0
% 3.73/1.16 prep_cycles: 5
% 3.73/1.16
% 3.73/1.16 splitting_time: 0.
% 3.73/1.16 sem_filter_time: 0.006
% 3.73/1.16 monotx_time: 0.
% 3.73/1.16 subtype_inf_time: 0.
% 3.73/1.16 res_prep_time: 0.019
% 3.73/1.16 sup_prep_time: 0.008
% 3.73/1.16 pred_elim_time: 0.05
% 3.73/1.16 bin_hyper_res_time: 0.
% 3.73/1.16 prep_time_total: 0.095
% 3.73/1.16
% 3.73/1.16 ------ Propositional Solver
% 3.73/1.16
% 3.73/1.16 prop_solver_calls: 139
% 3.73/1.16 prop_fast_solver_calls: 2817
% 3.73/1.16 smt_solver_calls: 0
% 3.73/1.16 smt_fast_solver_calls: 0
% 3.73/1.16 prop_num_of_clauses: 3163
% 3.73/1.16 prop_preprocess_simplified: 21054
% 3.73/1.16 prop_fo_subsumed: 1
% 3.73/1.16
% 3.73/1.16 prop_solver_time: 0.018
% 3.73/1.16 prop_fast_solver_time: 0.003
% 3.73/1.16 prop_unsat_core_time: 0.006
% 3.73/1.16 smt_solver_time: 0.
% 3.73/1.16 smt_fast_solver_time: 0.
% 3.73/1.16
% 3.73/1.16 ------ QBF
% 3.73/1.16
% 3.73/1.16 qbf_q_res: 0
% 3.73/1.16 qbf_num_tautologies: 0
% 3.73/1.16 qbf_prep_cycles: 0
% 3.73/1.16
% 3.73/1.16 ------ BMC1
% 3.73/1.16
% 3.73/1.16 bmc1_current_bound: -1
% 3.73/1.16 bmc1_last_solved_bound: -1
% 3.73/1.16 bmc1_unsat_core_size: -1
% 3.73/1.16 bmc1_unsat_core_parents_size: -1
% 3.73/1.16 bmc1_merge_next_fun: 0
% 3.73/1.16
% 3.73/1.16 bmc1_unsat_core_clauses_time: 0.
% 3.73/1.16
% 3.73/1.16 ------ Instantiation
% 3.73/1.16
% 3.73/1.16 inst_num_of_clauses: 249
% 3.73/1.16 inst_num_in_passive: 0
% 3.73/1.16 inst_num_in_active: 4498
% 3.73/1.16 inst_num_of_loops: 5075
% 3.73/1.16 inst_num_in_unprocessed: 0
% 3.73/1.16 inst_num_of_learning_restarts: 0
% 3.73/1.16 inst_num_moves_active_passive: 391
% 3.73/1.16 inst_lit_activity: 0
% 3.73/1.16 inst_lit_activity_moves: 0
% 3.73/1.16 inst_num_tautologies: 0
% 3.73/1.16 inst_num_prop_implied: 0
% 3.73/1.16 inst_num_existing_simplified: 0
% 3.73/1.16 inst_num_eq_res_simplified: 0
% 3.73/1.16 inst_num_child_elim: 0
% 3.73/1.16 inst_num_of_dismatching_blockings: 60
% 3.73/1.16 inst_num_of_non_proper_insts: 2357
% 3.73/1.16 inst_num_of_duplicates: 0
% 3.73/1.16 inst_inst_num_from_inst_to_res: 0
% 3.73/1.16
% 3.73/1.16 inst_time_sim_new: 0.076
% 3.73/1.16 inst_time_sim_given: 0.
% 3.73/1.16 inst_time_dismatching_checking: 0.003
% 3.73/1.16 inst_time_total: 0.232
% 3.73/1.16
% 3.73/1.16 ------ Resolution
% 3.73/1.16
% 3.73/1.16 res_num_of_clauses: 55
% 3.73/1.16 res_num_in_passive: 0
% 3.73/1.16 res_num_in_active: 0
% 3.73/1.16 res_num_of_loops: 311
% 3.73/1.16 res_forward_subset_subsumed: 104
% 3.73/1.16 res_backward_subset_subsumed: 8
% 3.73/1.16 res_forward_subsumed: 6
% 3.73/1.16 res_backward_subsumed: 0
% 3.73/1.16 res_forward_subsumption_resolution: 0
% 3.73/1.16 res_backward_subsumption_resolution: 0
% 3.73/1.16 res_clause_to_clause_subsumption: 2623
% 3.73/1.16 res_subs_bck_cnt: 3
% 3.73/1.16 res_orphan_elimination: 0
% 3.73/1.16 res_tautology_del: 33
% 3.73/1.16 res_num_eq_res_simplified: 4
% 3.73/1.16 res_num_sel_changes: 0
% 3.73/1.16 res_moves_from_active_to_pass: 0
% 3.73/1.16
% 3.73/1.16 res_time_sim_new: 0.003
% 3.73/1.16 res_time_sim_fw_given: 0.008
% 3.73/1.16 res_time_sim_bw_given: 0.004
% 3.73/1.16 res_time_total: 0.004
% 3.73/1.16
% 3.73/1.16 ------ Superposition
% 3.73/1.16
% 3.73/1.16 sup_num_of_clauses: undef
% 3.73/1.16 sup_num_in_active: undef
% 3.73/1.16 sup_num_in_passive: undef
% 3.73/1.16 sup_num_of_loops: 0
% 3.73/1.16 sup_fw_superposition: 0
% 3.73/1.16 sup_bw_superposition: 0
% 3.73/1.16 sup_eq_factoring: 0
% 3.73/1.16 sup_eq_resolution: 0
% 3.73/1.16 sup_immediate_simplified: 0
% 3.73/1.16 sup_given_eliminated: 0
% 3.73/1.16 comparisons_done: 71
% 3.73/1.16 comparisons_avoided: 0
% 3.73/1.16 comparisons_inc_criteria: 0
% 3.73/1.16 sup_deep_cl_discarded: 0
% 3.73/1.16 sup_num_of_deepenings: 0
% 3.73/1.16 sup_num_of_restarts: 0
% 3.73/1.16
% 3.73/1.16 sup_time_generating: 0.
% 3.73/1.16 sup_time_sim_fw_full: 0.
% 3.73/1.16 sup_time_sim_bw_full: 0.
% 3.73/1.16 sup_time_sim_fw_immed: 0.
% 3.73/1.16 sup_time_sim_bw_immed: 0.
% 3.73/1.16 sup_time_prep_sim_fw_input: 0.004
% 3.73/1.16 sup_time_prep_sim_bw_input: 0.003
% 3.73/1.16 sup_time_total: 0.
% 3.73/1.16
% 3.73/1.16 ------ Simplifications
% 3.73/1.16
% 3.73/1.16 sim_repeated: 0
% 3.73/1.16 sim_fw_subset_subsumed: 0
% 3.73/1.16 sim_bw_subset_subsumed: 0
% 3.73/1.16 sim_fw_subsumed: 0
% 3.73/1.16 sim_bw_subsumed: 0
% 3.73/1.16 sim_fw_subsumption_res: 0
% 3.73/1.16 sim_bw_subsumption_res: 0
% 3.73/1.16 sim_fw_unit_subs: 0
% 3.73/1.16 sim_bw_unit_subs: 0
% 3.73/1.16 sim_tautology_del: 0
% 3.73/1.16 sim_eq_tautology_del: 0
% 3.73/1.16 sim_eq_res_simp: 0
% 3.73/1.16 sim_fw_demodulated: 0
% 3.73/1.16 sim_bw_demodulated: 0
% 3.73/1.16 sim_encompassment_demod: 0
% 3.73/1.16 sim_light_normalised: 0
% 3.73/1.16 sim_ac_normalised: 0
% 3.73/1.16 sim_joinable_taut: 0
% 3.73/1.16 sim_joinable_simp: 0
% 3.73/1.16 sim_fw_ac_demod: 0
% 3.73/1.16 sim_bw_ac_demod: 0
% 3.73/1.16 sim_smt_subsumption: 0
% 3.73/1.16 sim_smt_simplified: 0
% 3.73/1.16 sim_ground_joinable: 0
% 3.73/1.16 sim_bw_ground_joinable: 0
% 3.73/1.16 sim_connectedness: 0
% 3.73/1.16
% 3.73/1.16 sim_time_fw_subset_subs: 0.
% 3.73/1.16 sim_time_bw_subset_subs: 0.
% 3.73/1.16 sim_time_fw_subs: 0.
% 3.73/1.16 sim_time_bw_subs: 0.
% 3.73/1.16 sim_time_fw_subs_res: 0.002
% 3.73/1.16 sim_time_bw_subs_res: 0.
% 3.73/1.16 sim_time_fw_unit_subs: 0.
% 3.73/1.16 sim_time_bw_unit_subs: 0.
% 3.73/1.16 sim_time_tautology_del: 0.
% 3.73/1.16 sim_time_eq_tautology_del: 0.
% 3.73/1.16 sim_time_eq_res_simp: 0.
% 3.73/1.16 sim_time_fw_demod: 0.
% 3.73/1.16 sim_time_bw_demod: 0.
% 3.73/1.16 sim_time_light_norm: 0.
% 3.73/1.16 sim_time_joinable: 0.
% 3.73/1.16 sim_time_ac_norm: 0.
% 3.73/1.16 sim_time_fw_ac_demod: 0.
% 3.73/1.16 sim_time_bw_ac_demod: 0.
% 3.73/1.16 sim_time_smt_subs: 0.
% 3.73/1.16 sim_time_fw_gjoin: 0.
% 3.73/1.16 sim_time_fw_connected: 0.
% 3.73/1.16
% 3.73/1.16
%------------------------------------------------------------------------------