TSTP Solution File: LDA001-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LDA001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:43:02 EDT 2024
% Result : Unsatisfiable 3.39s 1.11s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
f(f(X0,X1),f(X0,X2)) = f(X0,f(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).
cnf(c_50,plain,
f(n1,n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(c_51,plain,
f(n2,n1) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(c_52,plain,
f(n2,n2) = u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(c_53,negated_conjecture,
f(f(n3,n2),u) != f(f(u,u),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
cnf(c_68,plain,
f(n3,n2) = sP0_iProver_def,
definition ).
cnf(c_69,plain,
f(sP0_iProver_def,u) = sP1_iProver_def,
definition ).
cnf(c_70,plain,
f(u,u) = sP2_iProver_def,
definition ).
cnf(c_71,plain,
f(sP2_iProver_def,u) = sP3_iProver_def,
definition ).
cnf(c_72,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_53,c_70,c_71,c_68,c_69]) ).
cnf(c_111,plain,
f(n2,f(n1,X0)) = f(n1,f(n1,X0)),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_112,plain,
f(n2,f(n1,X0)) = f(n3,f(n2,X0)),
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_113,plain,
f(n2,f(n2,X0)) = f(u,f(n2,X0)),
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_114,plain,
f(n3,f(n2,X0)) = f(sP0_iProver_def,f(n3,X0)),
inference(superposition,[status(thm)],[c_68,c_49]) ).
cnf(c_119,plain,
f(f(n1,X0),n2) = f(n1,f(X0,n1)),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_148,plain,
f(n2,n2) = f(n1,n2),
inference(superposition,[status(thm)],[c_50,c_111]) ).
cnf(c_153,plain,
f(n1,n2) = u,
inference(light_normalisation,[status(thm)],[c_148,c_52]) ).
cnf(c_176,plain,
f(n2,f(n1,X0)) = f(sP0_iProver_def,f(n3,X0)),
inference(demodulation,[status(thm)],[c_112,c_114]) ).
cnf(c_179,plain,
f(sP0_iProver_def,f(n3,n1)) = f(n2,n2),
inference(superposition,[status(thm)],[c_50,c_176]) ).
cnf(c_180,plain,
f(sP0_iProver_def,f(n3,n2)) = f(n2,u),
inference(superposition,[status(thm)],[c_153,c_176]) ).
cnf(c_183,plain,
f(n2,u) = f(sP0_iProver_def,sP0_iProver_def),
inference(light_normalisation,[status(thm)],[c_180,c_68]) ).
cnf(c_184,plain,
f(sP0_iProver_def,f(n3,n1)) = u,
inference(light_normalisation,[status(thm)],[c_179,c_52]) ).
cnf(c_225,plain,
f(n2,u) = f(u,u),
inference(superposition,[status(thm)],[c_52,c_113]) ).
cnf(c_230,plain,
f(sP0_iProver_def,sP0_iProver_def) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_225,c_70,c_183]) ).
cnf(c_232,plain,
f(n2,u) = sP2_iProver_def,
inference(demodulation,[status(thm)],[c_183,c_230]) ).
cnf(c_267,plain,
f(n2,f(u,X0)) = f(sP2_iProver_def,f(n2,X0)),
inference(superposition,[status(thm)],[c_232,c_49]) ).
cnf(c_311,plain,
f(sP0_iProver_def,f(n3,n1)) = f(n3,n3),
inference(superposition,[status(thm)],[c_51,c_114]) ).
cnf(c_319,plain,
f(n3,n3) = u,
inference(light_normalisation,[status(thm)],[c_311,c_184]) ).
cnf(c_416,plain,
f(n1,f(n2,n1)) = f(u,n2),
inference(superposition,[status(thm)],[c_153,c_119]) ).
cnf(c_421,plain,
f(n1,n3) = f(u,n2),
inference(light_normalisation,[status(thm)],[c_416,c_51]) ).
cnf(c_553,plain,
f(n2,f(u,n2)) = f(sP0_iProver_def,f(n3,n3)),
inference(superposition,[status(thm)],[c_421,c_176]) ).
cnf(c_554,plain,
f(n2,f(u,n2)) = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_553,c_69,c_319]) ).
cnf(c_564,plain,
sP1_iProver_def = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_554,c_52,c_71,c_267]) ).
cnf(c_565,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_564,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LDA001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n026.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 21:37:06 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running UEQ theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.39/1.11 % SZS status Started for theBenchmark.p
% 3.39/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 3.39/1.11
% 3.39/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.39/1.11
% 3.39/1.11 ------ iProver source info
% 3.39/1.11
% 3.39/1.11 git: date: 2024-05-02 19:28:25 +0000
% 3.39/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.39/1.11 git: non_committed_changes: false
% 3.39/1.11
% 3.39/1.11 ------ Parsing...successful
% 3.39/1.11
% 3.39/1.11
% 3.39/1.11
% 3.39/1.11 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.39/1.11
% 3.39/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.39/1.11
% 3.39/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.39/1.11 ------ Proving...
% 3.39/1.11 ------ Problem Properties
% 3.39/1.11
% 3.39/1.11
% 3.39/1.11 clauses 9
% 3.39/1.11 conjectures 1
% 3.39/1.11 EPR 1
% 3.39/1.11 Horn 9
% 3.39/1.11 unary 9
% 3.39/1.11 binary 0
% 3.39/1.11 lits 9
% 3.39/1.11 lits eq 9
% 3.39/1.11 fd_pure 0
% 3.39/1.11 fd_pseudo 0
% 3.39/1.11 fd_cond 0
% 3.39/1.11 fd_pseudo_cond 0
% 3.39/1.11 AC symbols 0
% 3.39/1.11
% 3.39/1.11 ------ Input Options Time Limit: Unbounded
% 3.39/1.11
% 3.39/1.11
% 3.39/1.11 ------
% 3.39/1.11 Current options:
% 3.39/1.11 ------
% 3.39/1.11
% 3.39/1.11
% 3.39/1.11
% 3.39/1.11
% 3.39/1.11 ------ Proving...
% 3.39/1.11
% 3.39/1.11
% 3.39/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 3.39/1.11
% 3.39/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.39/1.11
% 3.39/1.11
%------------------------------------------------------------------------------