TSTP Solution File: LAT394-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LAT394-2 : TPTP v8.1.2. Released v5.4.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 : Fri May 3 02:35:40 EDT 2024
% Result : Unsatisfiable 4.17s 1.12s
% Output : CNFRefutation 4.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 2 RR)
% Number of literals : 33 ( 32 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 79 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
f(f(f(f(X0,X1),f(X1,X2)),X3),f(X1,f(f(X1,f(f(X0,X0),X0)),X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
cnf(c_50,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_90,plain,
f(X0,f(f(X0,X1),f(f(f(X0,X1),f(f(f(X2,X0),f(X2,X0)),f(X2,X0))),X3))) = f(X0,X1),
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_100,plain,
f(f(X0,X1),f(f(f(X0,X1),f(X1,X2)),X1)) = f(f(X0,X1),f(X1,X2)),
inference(superposition,[status(thm)],[c_49,c_90]) ).
cnf(c_130,plain,
f(f(f(f(X0,X1),f(X1,X2)),X1),f(X1,X1)) = X1,
inference(superposition,[status(thm)],[c_49,c_100]) ).
cnf(c_175,plain,
f(f(X0,X0),f(X0,X0)) = X0,
inference(superposition,[status(thm)],[c_130,c_130]) ).
cnf(c_197,plain,
f(f(X0,X1),f(X0,f(f(X0,f(f(X0,X0),X0)),X0))) = X0,
inference(superposition,[status(thm)],[c_175,c_49]) ).
cnf(c_291,plain,
f(f(X0,X1),f(X1,f(f(X1,f(f(X0,X0),X0)),X2))) = X1,
inference(superposition,[status(thm)],[c_197,c_49]) ).
cnf(c_294,plain,
f(X0,f(f(X0,f(f(X0,X0),X0)),X0)) = f(X0,X0),
inference(superposition,[status(thm)],[c_197,c_175]) ).
cnf(c_299,plain,
f(X0,f(f(X0,X1),f(X0,X1))) = f(X0,X1),
inference(superposition,[status(thm)],[c_197,c_90]) ).
cnf(c_305,plain,
f(f(X0,X1),f(X0,X0)) = X0,
inference(demodulation,[status(thm)],[c_197,c_294]) ).
cnf(c_387,plain,
f(X0,f(f(X1,X0),f(X1,X0))) = f(X1,X0),
inference(superposition,[status(thm)],[c_291,c_305]) ).
cnf(c_396,plain,
f(f(X0,X1),f(X1,X1)) = X1,
inference(superposition,[status(thm)],[c_291,c_100]) ).
cnf(c_669,plain,
f(f(X0,f(X1,X1)),X1) = f(X1,X1),
inference(superposition,[status(thm)],[c_396,c_396]) ).
cnf(c_764,plain,
f(f(X0,f(f(X0,f(f(X1,X1),X1)),X2)),f(X0,f(f(X0,f(f(X1,X1),X1)),X2))) = X0,
inference(superposition,[status(thm)],[c_669,c_49]) ).
cnf(c_797,plain,
f(f(f(f(X0,X1),f(X1,X2)),X3),f(X1,X1)) = X1,
inference(superposition,[status(thm)],[c_49,c_299]) ).
cnf(c_881,plain,
f(f(X0,f(f(X1,X2),f(X2,X3))),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
inference(superposition,[status(thm)],[c_387,c_49]) ).
cnf(c_997,plain,
f(f(f(X0,X1),f(X1,X1)),f(f(X1,X1),X2)) = f(f(f(X0,X1),f(X1,X1)),X1),
inference(superposition,[status(thm)],[c_797,c_100]) ).
cnf(c_1007,plain,
f(X0,f(f(X0,X0),X1)) = f(X0,X0),
inference(light_normalisation,[status(thm)],[c_997,c_396]) ).
cnf(c_1183,plain,
f(X0,f(f(X1,X0),f(f(f(X1,X0),f(f(X2,X2),X2)),f(X0,X3)))) = f(X1,X0),
inference(superposition,[status(thm)],[c_881,c_49]) ).
cnf(c_1362,plain,
f(f(X0,X0),f(X0,X1)) = X0,
inference(superposition,[status(thm)],[c_396,c_1007]) ).
cnf(c_1473,plain,
f(f(X0,X0),f(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_1183,c_1362]) ).
cnf(c_1561,plain,
f(f(f(X0,f(f(X0,f(f(X1,X1),X1)),X2)),f(X0,f(f(X0,f(f(X1,X1),X1)),X2))),X0) = f(X0,f(f(X0,f(f(X1,X1),X1)),X2)),
inference(superposition,[status(thm)],[c_881,c_1473]) ).
cnf(c_1629,plain,
f(X0,f(f(X0,f(f(X1,X1),X1)),X2)) = f(X0,X0),
inference(light_normalisation,[status(thm)],[c_1561,c_764]) ).
cnf(c_2183,plain,
f(X0,f(f(X1,X1),X1)) = f(X0,X0),
inference(superposition,[status(thm)],[c_1629,c_299]) ).
cnf(c_2357,plain,
f(X0,f(X1,f(X1,X1))) = f(X0,X0),
inference(superposition,[status(thm)],[c_1362,c_2183]) ).
cnf(c_2420,plain,
f(f(X0,f(f(X1,X1),X1)),f(X2,X0)) = X0,
inference(superposition,[status(thm)],[c_2183,c_1473]) ).
cnf(c_2436,plain,
f(f(X0,X1),f(X1,f(f(X2,X2),X2))) = X1,
inference(superposition,[status(thm)],[c_2183,c_396]) ).
cnf(c_2574,plain,
f(f(X0,X0),f(X1,f(X1,X1))) = X0,
inference(superposition,[status(thm)],[c_2357,c_1362]) ).
cnf(c_4552,plain,
f(f(X0,X0),X0) = f(f(X1,X1),X1),
inference(superposition,[status(thm)],[c_2436,c_2420]) ).
cnf(c_4715,plain,
f(f(X0,X0),X0) = f(X1,f(X1,X1)),
inference(superposition,[status(thm)],[c_4552,c_2574]) ).
cnf(c_4820,plain,
f(X0,f(X0,X0)) = f(X1,f(X1,X1)),
inference(superposition,[status(thm)],[c_4715,c_2574]) ).
cnf(c_5198,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_4820]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : LAT394-2 : TPTP v8.1.2. Released v5.4.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n010.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 17:59:19 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.42 Running UEQ theorem proving
% 0.17/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.17/1.12 % SZS status Started for theBenchmark.p
% 4.17/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 4.17/1.12
% 4.17/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.17/1.12
% 4.17/1.12 ------ iProver source info
% 4.17/1.12
% 4.17/1.12 git: date: 2024-05-02 19:28:25 +0000
% 4.17/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.17/1.12 git: non_committed_changes: false
% 4.17/1.12
% 4.17/1.12 ------ Parsing...successful
% 4.17/1.12
% 4.17/1.12
% 4.17/1.12
% 4.17/1.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 4.17/1.12
% 4.17/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.17/1.12
% 4.17/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.17/1.12 ------ Proving...
% 4.17/1.12 ------ Problem Properties
% 4.17/1.12
% 4.17/1.12
% 4.17/1.12 clauses 2
% 4.17/1.12 conjectures 1
% 4.17/1.12 EPR 0
% 4.17/1.12 Horn 2
% 4.17/1.12 unary 2
% 4.17/1.12 binary 0
% 4.17/1.12 lits 2
% 4.17/1.12 lits eq 2
% 4.17/1.12 fd_pure 0
% 4.17/1.12 fd_pseudo 0
% 4.17/1.12 fd_cond 0
% 4.17/1.12 fd_pseudo_cond 0
% 4.17/1.12 AC symbols 0
% 4.17/1.12
% 4.17/1.12 ------ Input Options Time Limit: Unbounded
% 4.17/1.12
% 4.17/1.12
% 4.17/1.12 ------
% 4.17/1.12 Current options:
% 4.17/1.12 ------
% 4.17/1.12
% 4.17/1.12
% 4.17/1.12
% 4.17/1.12
% 4.17/1.12 ------ Proving...
% 4.17/1.12
% 4.17/1.12
% 4.17/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 4.17/1.12
% 4.17/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.17/1.12
% 4.17/1.12
%------------------------------------------------------------------------------