TSTP Solution File: LCL929-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL929-1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 07:53:01 EDT 2023
% Result : Satisfiable 164.18s 22.89s
% Output : Saturation 164.18s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ p(i(X0,X1))
| ~ p(X0)
| p(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
cnf(c_50,plain,
( ~ p(i(f(X0,X1),X2))
| p(i(X0,i(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',resid1) ).
cnf(c_51,plain,
( ~ p(i(X0,i(X1,X2)))
| p(i(f(X0,X1),X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',resid2) ).
cnf(c_52,plain,
p(i(X0,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axI) ).
cnf(c_53,plain,
p(i(i(X0,X1),i(i(X1,X2),i(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axBp) ).
cnf(c_54,plain,
p(i(i(i(X0,X1),X1),i(i(X1,X0),X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axL) ).
cnf(c_55,negated_conjecture,
~ p(i(a,i(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axK) ).
cnf(c_103,plain,
( ~ p(i(X0,X1))
| p(i(i(X1,X2),i(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_49]) ).
cnf(c_105,plain,
( ~ p(i(i(X0,X1),X1))
| p(i(i(X1,X0),X0)) ),
inference(superposition,[status(thm)],[c_54,c_49]) ).
cnf(c_107,plain,
p(i(X0,i(X1,f(X0,X1)))),
inference(superposition,[status(thm)],[c_52,c_50]) ).
cnf(c_110,plain,
( ~ p(X0)
| p(i(X1,f(X0,X1))) ),
inference(superposition,[status(thm)],[c_107,c_49]) ).
cnf(c_111,plain,
p(i(X0,i(X1,i(X2,f(f(X0,X1),X2))))),
inference(superposition,[status(thm)],[c_107,c_50]) ).
cnf(c_114,plain,
( ~ p(X0)
| ~ p(X1)
| p(f(X0,X1)) ),
inference(superposition,[status(thm)],[c_110,c_49]) ).
cnf(c_115,plain,
( ~ p(X0)
| p(i(X1,i(X2,f(X0,f(X1,X2))))) ),
inference(superposition,[status(thm)],[c_110,c_50]) ).
cnf(c_117,plain,
( ~ p(i(X0,X1))
| ~ p(i(X1,X2))
| p(i(X0,X2)) ),
inference(superposition,[status(thm)],[c_103,c_49]) ).
cnf(c_123,plain,
p(i(f(i(X0,X1),X0),X1)),
inference(superposition,[status(thm)],[c_52,c_51]) ).
cnf(c_124,plain,
p(i(f(i(X0,X1),i(X1,X2)),i(X0,X2))),
inference(superposition,[status(thm)],[c_53,c_51]) ).
cnf(c_125,plain,
p(i(f(i(i(X0,X1),X1),i(X1,X0)),X0)),
inference(superposition,[status(thm)],[c_54,c_51]) ).
cnf(c_126,plain,
( ~ p(i(X0,X1))
| p(i(f(i(X1,X2),X0),X2)) ),
inference(superposition,[status(thm)],[c_103,c_51]) ).
cnf(c_131,plain,
( ~ p(f(i(X0,X1),X0))
| p(X1) ),
inference(superposition,[status(thm)],[c_123,c_49]) ).
cnf(c_133,plain,
p(i(f(f(i(X0,i(X1,X2)),X0),X1),X2)),
inference(superposition,[status(thm)],[c_123,c_51]) ).
cnf(c_145,plain,
( ~ p(X0)
| p(i(X1,i(X2,f(f(X0,X1),X2)))) ),
inference(superposition,[status(thm)],[c_111,c_49]) ).
cnf(c_146,plain,
p(i(X0,i(X1,i(X2,i(X3,f(f(f(X0,X1),X2),X3)))))),
inference(superposition,[status(thm)],[c_111,c_50]) ).
cnf(c_148,plain,
( ~ p(f(i(X0,X1),i(X1,X2)))
| p(i(X0,X2)) ),
inference(superposition,[status(thm)],[c_124,c_49]) ).
cnf(c_150,plain,
p(i(f(f(i(X0,X1),i(X1,X2)),X0),X2)),
inference(superposition,[status(thm)],[c_124,c_51]) ).
cnf(c_193,plain,
( ~ p(f(i(i(X0,X1),X1),i(X1,X0)))
| p(X0) ),
inference(superposition,[status(thm)],[c_125,c_49]) ).
cnf(c_195,plain,
p(i(f(f(i(i(i(X0,X1),X2),X2),i(X2,i(X0,X1))),X0),X1)),
inference(superposition,[status(thm)],[c_125,c_51]) ).
cnf(c_253,plain,
( ~ p(f(f(i(X0,i(X1,X2)),X0),X1))
| p(X2) ),
inference(superposition,[status(thm)],[c_133,c_49]) ).
cnf(c_255,plain,
p(i(f(f(f(i(X0,i(X1,i(X2,X3))),X0),X1),X2),X3)),
inference(superposition,[status(thm)],[c_133,c_51]) ).
cnf(c_292,plain,
( ~ p(f(f(i(X0,X1),i(X1,X2)),X0))
| p(X2) ),
inference(superposition,[status(thm)],[c_150,c_49]) ).
cnf(c_294,plain,
p(i(f(f(f(i(X0,X1),i(X1,i(X2,X3))),X0),X2),X3)),
inference(superposition,[status(thm)],[c_150,c_51]) ).
cnf(c_551,plain,
( ~ p(X0)
| p(i(f(X1,X2),f(X0,f(X1,X2)))) ),
inference(superposition,[status(thm)],[c_115,c_51]) ).
cnf(c_987,plain,
( ~ p(i(i(X0,f(X1,X0)),X2))
| p(i(X1,X2)) ),
inference(superposition,[status(thm)],[c_107,c_117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL929-1 : TPTP v8.1.2. Released v6.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n029.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 19:45:38 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
% 164.18/22.89 % SZS status Started for theBenchmark.p
% 164.18/22.89 % SZS status Satisfiable for theBenchmark.p
% 164.18/22.89
% 164.18/22.89 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 164.18/22.89
% 164.18/22.89 ------ iProver source info
% 164.18/22.89
% 164.18/22.89 git: date: 2023-05-31 18:12:56 +0000
% 164.18/22.89 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 164.18/22.89 git: non_committed_changes: false
% 164.18/22.89 git: last_make_outside_of_git: false
% 164.18/22.89
% 164.18/22.89 ------ Parsing...successful
% 164.18/22.89
% 164.18/22.89
% 164.18/22.89
% 164.18/22.89 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 164.18/22.89
% 164.18/22.89 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 164.18/22.89 ------ Proving...
% 164.18/22.89 ------ Problem Properties
% 164.18/22.89
% 164.18/22.89
% 164.18/22.89 clauses 7
% 164.18/22.89 conjectures 1
% 164.18/22.89 EPR 0
% 164.18/22.89 Horn 7
% 164.18/22.89 unary 4
% 164.18/22.89 binary 2
% 164.18/22.89 lits 11
% 164.18/22.89 lits eq 0
% 164.18/22.89 fd_pure 0
% 164.18/22.89 fd_pseudo 0
% 164.18/22.89 fd_cond 0
% 164.18/22.89 fd_pseudo_cond 0
% 164.18/22.89 AC symbols 0
% 164.18/22.89
% 164.18/22.89 ------ Input Options Time Limit: Unbounded
% 164.18/22.89
% 164.18/22.89
% 164.18/22.89 ------
% 164.18/22.89 Current options:
% 164.18/22.89 ------
% 164.18/22.89
% 164.18/22.89
% 164.18/22.89
% 164.18/22.89
% 164.18/22.89 ------ Proving...
% 164.18/22.89
% 164.18/22.89
% 164.18/22.89 % SZS status Satisfiable for theBenchmark.p
% 164.18/22.89
% 164.18/22.89 % SZS output start Saturation for theBenchmark.p
% See solution above
% 164.18/22.89
% 164.18/22.89
%------------------------------------------------------------------------------