TSTP Solution File: PUZ054-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : PUZ054-1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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 13:19:45 EDT 2023
% Result : Satisfiable 1.79s 1.19s
% Output : Model 1.79s
% Verified :
% SZS Type : Derivation
% Derivation depth : 0
% Number of leaves : 1
% Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% Number of atoms : 283 ( 282 equ)
% Maximal formula atoms : 283 ( 283 avg)
% Number of connectives : 417 ( 135 ~; 140 |; 141 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 148 ( 148 avg)
% Maximal term depth : 15 ( 4 avg)
% Number of predicates : 2 ( 1 usr; 0 prp; 2-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 3 (; 2 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of p
fof(lit_def,axiom,
! [X0,X1] :
( p(X0,X1)
<=> ( ( X0 = n0
& X1 = s(s(n0)) )
| ( X0 = n0
& X1 = s(s(s(n0))) )
| ( X0 = n0
& X1 = s(s(s(s(n0)))) )
| ( X0 = n0
& X1 = s(s(s(s(s(n0))))) )
| ( X0 = n0
& X1 = s(s(s(s(s(s(n0)))))) )
| ( X0 = n0
& X1 = s(s(s(s(s(s(s(n0))))))) )
| ( X0 = n0
& X1 = s(s(s(s(s(s(s(s(n0)))))))) )
| ( X0 = n0
& X1 = s(s(s(s(s(s(s(s(s(n0))))))))) )
| ( X0 = n0
& X1 = s(s(s(s(s(s(s(s(s(s(n0)))))))))) )
| ( X0 = n0
& X1 = s(s(s(s(s(s(s(s(s(s(s(n0))))))))))) )
| ( X0 = n0
& X1 = s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))) )
| ( X0 = n0
& X1 = s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))) )
| ( X0 = n0
& X1 = s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))) )
| ( X0 = s(s(n0))
& X1 = n0 )
| ( X0 = s(s(n0))
& X1 = s(n0) )
| ( X0 = s(s(n0))
& X1 = s(s(n0)) )
| ( X0 = s(s(n0))
& X1 = s(s(s(n0))) )
| ( X0 = s(s(n0))
& X1 = s(s(s(s(n0)))) )
| ( X0 = s(s(n0))
& X1 = s(s(s(s(s(n0))))) )
| ( X0 = s(s(n0))
& X1 = s(s(s(s(s(s(n0)))))) )
| ( X0 = s(s(n0))
& X1 = s(s(s(s(s(s(s(n0))))))) )
| ( X0 = s(s(n0))
& X1 = s(s(s(s(s(s(s(s(n0)))))))) )
| ( X0 = s(s(n0))
& X1 = s(s(s(s(s(s(s(s(s(n0))))))))) )
| ( X0 = s(s(n0))
& X1 = s(s(s(s(s(s(s(s(s(s(n0)))))))))) )
| ( X0 = s(s(n0))
& X1 = s(s(s(s(s(s(s(s(s(s(s(n0))))))))))) )
| ( X0 = s(s(n0))
& X1 = s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))) )
| ( X0 = s(s(n0))
& X1 = s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))) )
| ( X0 = s(s(s(s(n0))))
& X1 = n0 )
| ( X0 = s(s(s(s(n0))))
& X1 = s(n0) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(n0)) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(s(n0))) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(s(s(n0)))) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(s(s(s(n0))))) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(s(s(s(s(n0)))))) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(s(s(s(s(s(n0))))))) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(s(s(s(s(s(s(n0)))))))) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(s(s(s(s(s(s(s(n0))))))))) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(s(s(s(s(s(s(s(s(n0)))))))))) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(s(s(s(s(s(s(s(s(s(n0))))))))))) )
| ( X0 = s(s(s(s(n0))))
& X1 = s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = n0 )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(n0) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(s(n0)) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(s(s(n0))) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(s(s(s(n0)))) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(s(s(s(s(n0))))) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(s(s(s(s(s(n0)))))) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(s(s(s(s(s(s(n0))))))) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(s(s(s(s(s(s(s(n0)))))))) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(s(s(s(s(s(s(s(s(n0))))))))) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(s(s(s(s(s(s(s(s(s(n0)))))))))) )
| ( X0 = s(s(s(s(s(s(n0))))))
& X1 = s(s(s(s(s(s(s(s(s(s(s(n0))))))))))) )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = n0 )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = s(n0) )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = s(s(n0)) )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = s(s(s(n0))) )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = s(s(s(s(n0)))) )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = s(s(s(s(s(n0))))) )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = s(s(s(s(s(s(n0)))))) )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = s(s(s(s(s(s(s(n0))))))) )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = s(s(s(s(s(s(s(s(n0)))))))) )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = s(s(s(s(s(s(s(s(s(n0))))))))) )
| ( X0 = s(s(s(s(s(s(s(s(n0))))))))
& X1 = s(s(s(s(s(s(s(s(s(s(n0)))))))))) )
| ( X0 = s(s(s(s(s(s(s(s(s(s(n0))))))))))
& X1 = n0 )
| ( X0 = s(s(s(s(s(s(s(s(s(s(n0))))))))))
& X1 = s(n0) )
| ( X0 = s(s(s(s(s(s(s(s(s(s(n0))))))))))
& X1 = s(s(n0)) )
| ( X0 = s(s(s(s(s(s(s(s(s(s(n0))))))))))
& X1 = s(s(s(n0))) )
| ( X0 = s(s(s(s(s(s(s(s(s(s(n0))))))))))
& X1 = s(s(s(s(n0)))) )
| ( X0 = s(s(s(s(s(s(s(s(s(s(n0))))))))))
& X1 = s(s(s(s(s(n0))))) )
| ( X0 = s(s(s(s(s(s(s(s(s(s(n0))))))))))
& X1 = s(s(s(s(s(s(n0)))))) )
| ( X0 = s(s(s(s(s(s(s(s(s(s(n0))))))))))
& X1 = s(s(s(s(s(s(s(n0))))))) )
| ( X0 = s(s(s(s(s(s(s(s(s(s(n0))))))))))
& X1 = s(s(s(s(s(s(s(s(n0)))))))) )
| ( X0 = s(s(s(s(s(s(s(s(s(s(n0))))))))))
& X1 = s(s(s(s(s(s(s(s(s(n0))))))))) )
| ? [X2] :
( X1 = s(X2)
& ( X0 != n0
| X2 != s(n0) )
& ( X0 != n0
| X2 != s(s(n0)) )
& ( X0 != n0
| X2 != s(s(s(n0))) )
& ( X0 != n0
| X2 != s(s(s(s(n0)))) )
& ( X0 != n0
| X2 != s(s(s(s(s(n0))))) )
& ( X0 != n0
| X2 != s(s(s(s(s(s(n0)))))) )
& ( X0 != n0
| X2 != s(s(s(s(s(s(s(n0))))))) )
& ( X0 != n0
| X2 != s(s(s(s(s(s(s(s(n0)))))))) )
& ( X0 != n0
| X2 != s(s(s(s(s(s(s(s(s(n0))))))))) )
& ( X0 != n0
| X2 != s(s(s(s(s(s(s(s(s(s(n0)))))))))) )
& ( X0 != n0
| X2 != s(s(s(s(s(s(s(s(s(s(s(n0))))))))))) )
& ( X0 != n0
| X2 != s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))) )
& ( X0 != n0
| X2 != s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))) )
& ( X0 != s(s(n0))
| X2 != n0 )
& ( X0 != s(s(n0))
| X2 != s(n0) )
& ( X0 != s(s(n0))
| X2 != s(s(n0)) )
& ( X0 != s(s(n0))
| X2 != s(s(s(n0))) )
& ( X0 != s(s(n0))
| X2 != s(s(s(s(n0)))) )
& ( X0 != s(s(n0))
| X2 != s(s(s(s(s(n0))))) )
& ( X0 != s(s(n0))
| X2 != s(s(s(s(s(s(n0)))))) )
& ( X0 != s(s(n0))
| X2 != s(s(s(s(s(s(s(n0))))))) )
& ( X0 != s(s(n0))
| X2 != s(s(s(s(s(s(s(s(n0)))))))) )
& ( X0 != s(s(n0))
| X2 != s(s(s(s(s(s(s(s(s(n0))))))))) )
& ( X0 != s(s(n0))
| X2 != s(s(s(s(s(s(s(s(s(s(n0)))))))))) )
& ( X0 != s(s(n0))
| X2 != s(s(s(s(s(s(s(s(s(s(s(n0))))))))))) )
& ( X0 != s(s(n0))
| X2 != s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))) )
& ( X0 != s(s(s(s(n0))))
| X2 != n0 )
& ( X0 != s(s(s(s(n0))))
| X2 != s(n0) )
& ( X0 != s(s(s(s(n0))))
| X2 != s(s(n0)) )
& ( X0 != s(s(s(s(n0))))
| X2 != s(s(s(n0))) )
& ( X0 != s(s(s(s(n0))))
| X2 != s(s(s(s(n0)))) )
& ( X0 != s(s(s(s(n0))))
| X2 != s(s(s(s(s(n0))))) )
& ( X0 != s(s(s(s(n0))))
| X2 != s(s(s(s(s(s(n0)))))) )
& ( X0 != s(s(s(s(n0))))
| X2 != s(s(s(s(s(s(s(n0))))))) )
& ( X0 != s(s(s(s(n0))))
| X2 != s(s(s(s(s(s(s(s(n0)))))))) )
& ( X0 != s(s(s(s(n0))))
| X2 != s(s(s(s(s(s(s(s(s(n0))))))))) )
& ( X0 != s(s(s(s(n0))))
| X2 != s(s(s(s(s(s(s(s(s(s(n0)))))))))) )
& ( X0 != s(s(s(s(n0))))
| X2 != s(s(s(s(s(s(s(s(s(s(s(n0))))))))))) )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != n0 )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != s(n0) )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != s(s(n0)) )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != s(s(s(n0))) )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != s(s(s(s(n0)))) )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != s(s(s(s(s(n0))))) )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != s(s(s(s(s(s(n0)))))) )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != s(s(s(s(s(s(s(n0))))))) )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != s(s(s(s(s(s(s(s(n0)))))))) )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != s(s(s(s(s(s(s(s(s(n0))))))))) )
& ( X0 != s(s(s(s(s(s(n0))))))
| X2 != s(s(s(s(s(s(s(s(s(s(n0)))))))))) )
& ( X0 != s(s(s(s(s(s(s(s(n0))))))))
| X2 != n0 )
& ( X0 != s(s(s(s(s(s(s(s(n0))))))))
| X2 != s(n0) )
& ( X0 != s(s(s(s(s(s(s(s(n0))))))))
| X2 != s(s(n0)) )
& ( X0 != s(s(s(s(s(s(s(s(n0))))))))
| X2 != s(s(s(n0))) )
& ( X0 != s(s(s(s(s(s(s(s(n0))))))))
| X2 != s(s(s(s(n0)))) )
& ( X0 != s(s(s(s(s(s(s(s(n0))))))))
| X2 != s(s(s(s(s(n0))))) )
& ( X0 != s(s(s(s(s(s(s(s(n0))))))))
| X2 != s(s(s(s(s(s(n0)))))) )
& ( X0 != s(s(s(s(s(s(s(s(n0))))))))
| X2 != s(s(s(s(s(s(s(n0))))))) )
& ( X0 != s(s(s(s(s(s(s(s(n0))))))))
| X2 != s(s(s(s(s(s(s(s(n0)))))))) )
& ( X0 != s(s(s(s(s(s(s(s(n0))))))))
| X2 != s(s(s(s(s(s(s(s(s(n0))))))))) )
& ( X0 != s(s(s(s(s(s(s(s(s(s(n0))))))))))
| X2 != n0 )
& ( X0 != s(s(s(s(s(s(s(s(s(s(n0))))))))))
| X2 != s(n0) )
& ( X0 != s(s(s(s(s(s(s(s(s(s(n0))))))))))
| X2 != s(s(n0)) )
& ( X0 != s(s(s(s(s(s(s(s(s(s(n0))))))))))
| X2 != s(s(s(n0))) )
& ( X0 != s(s(s(s(s(s(s(s(s(s(n0))))))))))
| X2 != s(s(s(s(n0)))) )
& ( X0 != s(s(s(s(s(s(s(s(s(s(n0))))))))))
| X2 != s(s(s(s(s(n0))))) )
& ( X0 != s(s(s(s(s(s(s(s(s(s(n0))))))))))
| X2 != s(s(s(s(s(s(n0)))))) )
& ( X0 != s(s(s(s(s(s(s(s(s(s(n0))))))))))
| X2 != s(s(s(s(s(s(s(n0))))))) )
& X0 != s(X0) ) ) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ054-1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n010.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 : Sat Aug 26 22:37:35 EDT 2023
% 0.13/0.34 % 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.79/1.19 % SZS status Started for theBenchmark.p
% 1.79/1.19 % SZS status Satisfiable for theBenchmark.p
% 1.79/1.19
% 1.79/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.79/1.19
% 1.79/1.19 ------ iProver source info
% 1.79/1.19
% 1.79/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.79/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.79/1.19 git: non_committed_changes: false
% 1.79/1.19 git: last_make_outside_of_git: false
% 1.79/1.19
% 1.79/1.19 ------ Parsing...successful
% 1.79/1.19
% 1.79/1.19
% 1.79/1.19
% 1.79/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.79/1.19
% 1.79/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.79/1.19 ------ Proving...
% 1.79/1.19 ------ Problem Properties
% 1.79/1.19
% 1.79/1.19
% 1.79/1.19 clauses 5
% 1.79/1.19 conjectures 1
% 1.79/1.19 EPR 0
% 1.79/1.19 Horn 5
% 1.79/1.19 unary 2
% 1.79/1.19 binary 3
% 1.79/1.19 lits 8
% 1.79/1.19 lits eq 0
% 1.79/1.19 fd_pure 0
% 1.79/1.19 fd_pseudo 0
% 1.79/1.19 fd_cond 0
% 1.79/1.19 fd_pseudo_cond 0
% 1.79/1.19 AC symbols 0
% 1.79/1.19
% 1.79/1.19 ------ Schedule dynamic 5 is on
% 1.79/1.19
% 1.79/1.19 ------ no equalities: superposition off
% 1.79/1.19
% 1.79/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.79/1.19
% 1.79/1.19
% 1.79/1.19 ------
% 1.79/1.19 Current options:
% 1.79/1.19 ------
% 1.79/1.19
% 1.79/1.19
% 1.79/1.19
% 1.79/1.19
% 1.79/1.19 ------ Proving...
% 1.79/1.19
% 1.79/1.19
% 1.79/1.19 % SZS status Satisfiable for theBenchmark.p
% 1.79/1.19
% 1.79/1.19 ------ Building Model...Done
% 1.79/1.19
% 1.79/1.19 %------ The model is defined over ground terms (initial term algebra).
% 1.79/1.19 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 1.79/1.19 %------ where \phi is a formula over the term algebra.
% 1.79/1.19 %------ If we have equality in the problem then it is also defined as a predicate above,
% 1.79/1.19 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 1.79/1.19 %------ See help for --sat_out_model for different model outputs.
% 1.79/1.19 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 1.79/1.19 %------ where the first argument stands for the sort ($i in the unsorted case)
% 1.79/1.19 % SZS output start Model for theBenchmark.p
% See solution above
% 1.79/1.19
%------------------------------------------------------------------------------