TSTP Solution File: SYN059-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN059-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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 : Fri Sep 1 03:04:58 EDT 2023
% Result : Satisfiable 1.63s 1.19s
% Output : Model 1.63s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Negative definition of big_f
fof(lit_def,axiom,
! [X0] :
( ~ big_f(X0)
<=> $false ) ).
%------ Positive definition of big_g
fof(lit_def_001,axiom,
! [X0] :
( big_g(X0)
<=> ( X0 = b
| X0 = d ) ) ).
%------ Negative definition of big_h
fof(lit_def_002,axiom,
! [X0] :
( ~ big_h(X0)
<=> $false ) ).
%------ Negative definition of big_j
fof(lit_def_003,axiom,
! [X0] :
( ~ big_j(X0)
<=> X0 = f ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_004,axiom,
( sP0_iProver_split
<=> $true ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_005,axiom,
( sP1_iProver_split
<=> $false ) ).
%------ Positive definition of sP2_iProver_split
fof(lit_def_006,axiom,
( sP2_iProver_split
<=> $false ) ).
%------ Positive definition of sP3_iProver_split
fof(lit_def_007,axiom,
( sP3_iProver_split
<=> $true ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN059-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat Aug 26 20:44:14 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.63/1.19 % SZS status Started for theBenchmark.p
% 1.63/1.19 % SZS status Satisfiable for theBenchmark.p
% 1.63/1.19
% 1.63/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.63/1.19
% 1.63/1.19 ------ iProver source info
% 1.63/1.19
% 1.63/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.63/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.63/1.19 git: non_committed_changes: false
% 1.63/1.19 git: last_make_outside_of_git: false
% 1.63/1.19
% 1.63/1.19 ------ Parsing...successful
% 1.63/1.19
% 1.63/1.19 ------ preprocesses with Option_epr_non_horn_non_eq
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.63/1.19
% 1.63/1.19 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_non_eq
% 1.63/1.19 gs_s sp: 32 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.63/1.19 ------ Proving...
% 1.63/1.19 ------ Problem Properties
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19 clauses 36
% 1.63/1.19 conjectures 34
% 1.63/1.19 EPR 36
% 1.63/1.19 Horn 12
% 1.63/1.19 unary 2
% 1.63/1.19 binary 4
% 1.63/1.19 lits 106
% 1.63/1.19 lits eq 0
% 1.63/1.19 fd_pure 0
% 1.63/1.19 fd_pseudo 0
% 1.63/1.19 fd_cond 0
% 1.63/1.19 fd_pseudo_cond 0
% 1.63/1.19 AC symbols 0
% 1.63/1.19
% 1.63/1.19 ------ Schedule EPR non Horn non eq is on
% 1.63/1.19
% 1.63/1.19 ------ no equalities: superposition off
% 1.63/1.19
% 1.63/1.19 ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19 ------
% 1.63/1.19 Current options:
% 1.63/1.19 ------
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19 ------ Proving...
% 1.63/1.19
% 1.63/1.19
% 1.63/1.19 % SZS status Satisfiable for theBenchmark.p
% 1.63/1.19
% 1.63/1.19 ------ Building Model...Done
% 1.63/1.19
% 1.63/1.19 %------ The model is defined over ground terms (initial term algebra).
% 1.63/1.19 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.63/1.19 %------ where \phi is a formula over the term algebra.
% 1.63/1.19 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.63/1.19 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.63/1.19 %------ See help for --sat_out_model for different model outputs.
% 1.63/1.19 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.63/1.19 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.63/1.19 % SZS output start Model for theBenchmark.p
% See solution above
% 1.63/1.19
%------------------------------------------------------------------------------