TSTP Solution File: LAT384+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LAT384+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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 06:18:25 EDT 2023
% Result : CounterSatisfiable 31.95s 5.23s
% Output : Model 31.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LAT384+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n031.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 24 05:25:06 EDT 2023
% 0.15/0.35 % 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
% 31.95/5.23 % SZS status Started for theBenchmark.p
% 31.95/5.23 % SZS status CounterSatisfiable for theBenchmark.p
% 31.95/5.23
% 31.95/5.23 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 31.95/5.23
% 31.95/5.23 ------ iProver source info
% 31.95/5.23
% 31.95/5.23 git: date: 2023-05-31 18:12:56 +0000
% 31.95/5.23 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 31.95/5.23 git: non_committed_changes: false
% 31.95/5.23 git: last_make_outside_of_git: false
% 31.95/5.23
% 31.95/5.23 ------ Parsing...
% 31.95/5.23 ------ Clausification by vclausify_rel & Parsing by iProver...
% 31.95/5.23
% 31.95/5.23 ------ Preprocessing... sup_sim: 5 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 7 sf_s rm: 7 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe_e
% 31.95/5.23
% 31.95/5.23 ------ Preprocessing...
% 31.95/5.23
% 31.95/5.23 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 31.95/5.23 ------ Proving...
% 31.95/5.23 ------ Problem Properties
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 clauses 39
% 31.95/5.23 conjectures 1
% 31.95/5.23 EPR 21
% 31.95/5.23 Horn 34
% 31.95/5.23 unary 6
% 31.95/5.23 binary 4
% 31.95/5.23 lits 144
% 31.95/5.23 lits eq 6
% 31.95/5.23 fd_pure 0
% 31.95/5.23 fd_pseudo 0
% 31.95/5.23 fd_cond 0
% 31.95/5.23 fd_pseudo_cond 3
% 31.95/5.23 AC symbols 0
% 31.95/5.23
% 31.95/5.23 ------ Input Options Time Limit: Unbounded
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------
% 31.95/5.23 Current options:
% 31.95/5.23 ------
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 ------ Proving...
% 31.95/5.23
% 31.95/5.23
% 31.95/5.23 % SZS status CounterSatisfiable for theBenchmark.p
% 31.95/5.23
% 31.95/5.23 ------ Building Model...Done
% 31.95/5.23
% 31.95/5.23 %------ The model is defined over ground terms (initial term algebra).
% 31.95/5.23 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 31.95/5.23 %------ where \phi is a formula over the term algebra.
% 31.95/5.23 %------ If we have equality in the problem then it is also defined as a predicate above,
% 31.95/5.23 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 31.95/5.23 %------ See help for --sat_out_model for different model outputs.
% 31.95/5.23 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 31.95/5.23 %------ where the first argument stands for the sort ($i in the unsorted case)
% 31.95/5.23 % SZS output start Model for theBenchmark.p
% 31.95/5.23
% 31.95/5.23 %------ Negative definition of equality_sorted
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0_12,X0_1,X1_1] :
% 31.95/5.23 ( ~(equality_sorted(X0_12,X0_1,X1_1)) <=>
% 31.95/5.23 (
% 31.95/5.23 (
% 31.95/5.23 ( X0_12=iProver_aElementOf0_2_$i & X0_14=xU )
% 31.95/5.23 &
% 31.95/5.23 ( X1_14!=xU )
% 31.95/5.23 &
% 31.95/5.23 ( X1_14!=szRzazndt0(xf) )
% 31.95/5.23 &
% 31.95/5.23 ( X1_14!=szDzozmdt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_12=iProver_aElementOf0_2_$i & X0_14=xT )
% 31.95/5.23 &
% 31.95/5.23 ( X1_14!=xT )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_12=iProver_aElementOf0_2_$i & X0_14=szRzazndt0(xf) )
% 31.95/5.23 &
% 31.95/5.23 ( X1_14!=xU )
% 31.95/5.23 &
% 31.95/5.23 ( X1_14!=szRzazndt0(xf) )
% 31.95/5.23 &
% 31.95/5.23 ( X1_14!=szDzozmdt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_12=iProver_aElementOf0_2_$i & X0_14=szDzozmdt0(xf) )
% 31.95/5.23 &
% 31.95/5.23 ( X1_14!=xU )
% 31.95/5.23 &
% 31.95/5.23 ( X1_14!=szRzazndt0(xf) )
% 31.95/5.23 &
% 31.95/5.23 ( X1_14!=szDzozmdt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_12=iProver_aElementOf0_2_$i & X1_14=xU )
% 31.95/5.23 &
% 31.95/5.23 ( X0_14!=xU )
% 31.95/5.23 &
% 31.95/5.23 ( X0_14!=szRzazndt0(xf) )
% 31.95/5.23 &
% 31.95/5.23 ( X0_14!=szDzozmdt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_12=iProver_aElementOf0_2_$i & X1_14=xT )
% 31.95/5.23 &
% 31.95/5.23 ( X0_14!=xT )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_12=iProver_aElementOf0_2_$i & X1_14=szRzazndt0(xf) )
% 31.95/5.23 &
% 31.95/5.23 ( X0_14!=xU )
% 31.95/5.23 &
% 31.95/5.23 ( X0_14!=szRzazndt0(xf) )
% 31.95/5.23 &
% 31.95/5.23 ( X0_14!=szDzozmdt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_12=iProver_aElementOf0_2_$i & X1_14=szDzozmdt0(xf) )
% 31.95/5.23 &
% 31.95/5.23 ( X0_14!=xU )
% 31.95/5.23 &
% 31.95/5.23 ( X0_14!=szRzazndt0(xf) )
% 31.95/5.23 &
% 31.95/5.23 ( X0_14!=szDzozmdt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Positive definition of aSet0
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0_14] :
% 31.95/5.23 ( aSet0(X0_14) <=>
% 31.95/5.23 (
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=xU )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=szRzazndt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=szDzozmdt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Positive definition of isEmpty0
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0] :
% 31.95/5.23 ( isEmpty0(X0) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Positive definition of aSubsetOf0
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0_14,X1_14] :
% 31.95/5.23 ( aSubsetOf0(X0_14,X1_14) <=>
% 31.95/5.23 (
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=xU & X1_14=xU )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=xU & X1_14=szRzazndt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=xU & X1_14=szDzozmdt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=szRzazndt0(xf) & X1_14=xU )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=szRzazndt0(xf) & X1_14=szRzazndt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=szRzazndt0(xf) & X1_14=szDzozmdt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=szDzozmdt0(xf) & X1_14=xU )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=szDzozmdt0(xf) & X1_14=szRzazndt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=szDzozmdt0(xf) & X1_14=szDzozmdt0(xf) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Positive definition of aCompleteLattice0
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0] :
% 31.95/5.23 ( aCompleteLattice0(X0) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Positive definition of aFunction0
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0] :
% 31.95/5.23 ( aFunction0(X0) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Positive definition of isOn0
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0,X1] :
% 31.95/5.23 ( isOn0(X0,X1) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Positive definition of aFixedPointOf0
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0,X1] :
% 31.95/5.23 ( aFixedPointOf0(X0,X1) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Positive definition of isMonotone0
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0] :
% 31.95/5.23 ( isMonotone0(X0) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Negative definition of arAF0_sdtlseqdt0_0_1
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0_13] :
% 31.95/5.23 ( ~(arAF0_sdtlseqdt0_0_1(X0_13)) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Negative definition of arAF0_aElementOf0_0_1
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0_13] :
% 31.95/5.23 ( ~(arAF0_aElementOf0_0_1(X0_13)) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Negative definition of arAF0_aInfimumOfIn0_0_1
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0_13] :
% 31.95/5.23 ( ~(arAF0_aInfimumOfIn0_0_1(X0_13)) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Negative definition of arAF0_aUpperBoundOfIn0_0_1
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0_13] :
% 31.95/5.23 ( ~(arAF0_aUpperBoundOfIn0_0_1(X0_13)) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Negative definition of arAF0_aLowerBoundOfIn0_0_1
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0_13] :
% 31.95/5.23 ( ~(arAF0_aLowerBoundOfIn0_0_1(X0_13)) <=>
% 31.95/5.23 $false
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23
% 31.95/5.23 %------ Negative definition of arG4_aSupremumOfIn0_0_1_2
% 31.95/5.23 fof(lit_def,axiom,
% 31.95/5.23 (! [X0_13,X0_14,X1_14] :
% 31.95/5.23 ( ~(arG4_aSupremumOfIn0_0_1_2(X0_13,X0_14,X1_14)) <=>
% 31.95/5.23 (
% 31.95/5.23 ? [X2_14] :
% 31.95/5.23 (
% 31.95/5.23 ( X0_13=arG4_arAF0_sK7_0_1_0(X2_14) & X0_14=xT )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 |
% 31.95/5.23 (
% 31.95/5.23 ( X0_14=xT )
% 31.95/5.23 &
% 31.95/5.23 ( X0_13!=arG4_arAF0_sK7_0_1_0(X2_14) )
% 31.95/5.23 &
% 31.95/5.23 ( X0_13!=arG4_arAF0_sK7_0_1_0(X1_14) )
% 31.95/5.23 )
% 31.95/5.23
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 )
% 31.95/5.23 ).
% 31.95/5.23 % SZS output end Model for theBenchmark.p
% 31.95/5.23
%------------------------------------------------------------------------------