TSTP Solution File: SYO038-1.003.003 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYO038-1.003.003 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 04:38:33 EDT 2023
% Result : Unsatisfiable 3.14s 1.17s
% Output : CNFRefutation 3.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 35 ( 17 unt; 0 nHn; 28 RR)
% Number of literals : 57 ( 15 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 19 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
f(X0,one) = s(one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
cnf(c_50,plain,
s(s(f(one,X0))) = f(one,s(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
cnf(c_51,plain,
f(X0,f(s(X0),X1)) = f(s(X0),s(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
cnf(c_52,plain,
d(one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
cnf(c_53,plain,
( ~ d(X0)
| d(s(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
cnf(c_54,negated_conjecture,
~ d(f(s(s(one)),s(s(one)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
cnf(c_55,plain,
( ~ d(one)
| d(s(one)) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_56,plain,
f(one,one) = s(one),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_86,plain,
( X0 != X1
| ~ d(X1)
| d(X0) ),
theory(equality) ).
cnf(c_171,plain,
f(one,s(one)) = s(s(s(one))),
inference(superposition,[status(thm)],[c_49,c_50]) ).
cnf(c_172,plain,
( ~ d(s(f(one,X0)))
| d(f(one,s(X0))) ),
inference(superposition,[status(thm)],[c_50,c_53]) ).
cnf(c_176,plain,
s(s(s(s(s(one))))) = f(one,s(s(one))),
inference(superposition,[status(thm)],[c_171,c_50]) ).
cnf(c_181,plain,
( ~ d(f(one,X0))
| d(f(one,s(X0))) ),
inference(superposition,[status(thm)],[c_53,c_172]) ).
cnf(c_183,plain,
( ~ d(s(s(s(s(one)))))
| d(f(one,s(s(one)))) ),
inference(superposition,[status(thm)],[c_171,c_172]) ).
cnf(c_196,plain,
( ~ d(f(one,one))
| d(s(s(s(one)))) ),
inference(superposition,[status(thm)],[c_171,c_181]) ).
cnf(c_197,plain,
( ~ d(f(one,s(f(one,X0))))
| d(f(one,f(one,s(X0)))) ),
inference(superposition,[status(thm)],[c_50,c_181]) ).
cnf(c_207,plain,
( ~ d(s(s(s(one))))
| d(f(one,s(s(one)))) ),
inference(superposition,[status(thm)],[c_53,c_183]) ).
cnf(c_210,plain,
f(s(X0),s(one)) = f(X0,s(one)),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_226,plain,
f(X0,f(X0,s(one))) = f(s(X0),s(s(one))),
inference(superposition,[status(thm)],[c_210,c_51]) ).
cnf(c_246,plain,
( ~ d(f(one,s(s(s(s(one))))))
| d(f(one,f(one,s(s(one))))) ),
inference(superposition,[status(thm)],[c_176,c_181]) ).
cnf(c_259,plain,
f(s(X0),f(X0,s(one))) = f(s(s(X0)),s(s(one))),
inference(superposition,[status(thm)],[c_210,c_226]) ).
cnf(c_261,plain,
f(X0,f(X0,f(X0,s(one)))) = f(s(X0),s(s(s(one)))),
inference(superposition,[status(thm)],[c_226,c_51]) ).
cnf(c_263,plain,
~ d(f(s(one),f(one,s(one)))),
inference(demodulation,[status(thm)],[c_54,c_259]) ).
cnf(c_264,plain,
~ d(f(s(one),s(s(s(one))))),
inference(light_normalisation,[status(thm)],[c_263,c_171]) ).
cnf(c_268,plain,
( f(X0,X1) != X2
| ~ d(X2)
| d(f(X0,X1)) ),
inference(instantiation,[status(thm)],[c_86]) ).
cnf(c_281,plain,
( ~ d(f(one,f(one,X0)))
| d(f(one,f(one,s(X0)))) ),
inference(superposition,[status(thm)],[c_181,c_197]) ).
cnf(c_282,plain,
( ~ d(f(one,s(s(one))))
| d(f(one,f(one,s(one)))) ),
inference(superposition,[status(thm)],[c_49,c_197]) ).
cnf(c_285,plain,
( ~ d(f(one,s(s(one))))
| d(f(one,s(s(s(one))))) ),
inference(light_normalisation,[status(thm)],[c_282,c_171]) ).
cnf(c_385,plain,
( f(X0,one) != s(one)
| ~ d(s(one))
| d(f(X0,one)) ),
inference(instantiation,[status(thm)],[c_268]) ).
cnf(c_386,plain,
( f(one,one) != s(one)
| ~ d(s(one))
| d(f(one,one)) ),
inference(instantiation,[status(thm)],[c_385]) ).
cnf(c_397,plain,
( ~ d(f(one,s(s(s(one)))))
| d(f(one,f(one,s(s(one))))) ),
inference(superposition,[status(thm)],[c_181,c_246]) ).
cnf(c_401,plain,
f(one,f(one,s(s(s(one))))) = f(s(one),s(s(s(one)))),
inference(superposition,[status(thm)],[c_171,c_261]) ).
cnf(c_632,plain,
d(f(one,f(one,s(s(one))))),
inference(global_subsumption_just,[status(thm)],[c_397,c_52,c_55,c_56,c_196,c_207,c_285,c_386,c_397]) ).
cnf(c_637,plain,
( ~ d(f(one,f(one,s(s(one)))))
| d(f(s(one),s(s(s(one))))) ),
inference(superposition,[status(thm)],[c_401,c_281]) ).
cnf(c_638,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_637,c_264,c_632]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYO038-1.003.003 : TPTP v8.1.2. Released v5.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n013.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 : Sat Aug 26 07:43:17 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.14/1.17 % SZS status Started for theBenchmark.p
% 3.14/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.14/1.17
% 3.14/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.14/1.17
% 3.14/1.17 ------ iProver source info
% 3.14/1.17
% 3.14/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.14/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.14/1.17 git: non_committed_changes: false
% 3.14/1.17 git: last_make_outside_of_git: false
% 3.14/1.17
% 3.14/1.17 ------ Parsing...successful
% 3.14/1.17
% 3.14/1.17
% 3.14/1.17
% 3.14/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.14/1.17
% 3.14/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.14/1.17
% 3.14/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.14/1.17 ------ Proving...
% 3.14/1.17 ------ Problem Properties
% 3.14/1.17
% 3.14/1.17
% 3.14/1.17 clauses 6
% 3.14/1.17 conjectures 1
% 3.14/1.17 EPR 1
% 3.14/1.17 Horn 6
% 3.14/1.17 unary 5
% 3.14/1.17 binary 1
% 3.14/1.17 lits 7
% 3.14/1.17 lits eq 3
% 3.14/1.17 fd_pure 0
% 3.14/1.17 fd_pseudo 0
% 3.14/1.17 fd_cond 0
% 3.14/1.17 fd_pseudo_cond 0
% 3.14/1.17 AC symbols 0
% 3.14/1.17
% 3.14/1.17 ------ Schedule dynamic 5 is on
% 3.14/1.17
% 3.14/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.14/1.17
% 3.14/1.17
% 3.14/1.17 ------
% 3.14/1.17 Current options:
% 3.14/1.17 ------
% 3.14/1.17
% 3.14/1.17
% 3.14/1.17
% 3.14/1.17
% 3.14/1.17 ------ Proving...
% 3.14/1.17
% 3.14/1.17
% 3.14/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.14/1.17
% 3.14/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.14/1.17
% 3.14/1.17
%------------------------------------------------------------------------------