TSTP Solution File: NUM001-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:48:04 EDT 2024
% Result : Unsatisfiable 3.41s 1.12s
% Output : CNFRefutation 3.41s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ equalish(add(add(a,b),c),add(a,add(b,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equation) ).
cnf(c_51,plain,
( ~ equalish(X0,X1)
| ~ equalish(X1,X2)
| equalish(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM002-0.ax',transitivity) ).
cnf(c_52,plain,
equalish(add(X0,X1),add(X1,X0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM002-0.ax',commutativity_of_addition) ).
cnf(c_53,plain,
equalish(add(X0,add(X1,X2)),add(add(X0,X1),X2)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM002-0.ax',associativity_of_addition) ).
cnf(c_115,plain,
add(a,b) = sP0_iProver_def,
definition ).
cnf(c_116,plain,
add(sP0_iProver_def,c) = sP1_iProver_def,
definition ).
cnf(c_117,plain,
add(b,c) = sP2_iProver_def,
definition ).
cnf(c_118,plain,
add(a,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_119,negated_conjecture,
~ equalish(sP1_iProver_def,sP3_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_117,c_118,c_115,c_116]) ).
cnf(c_294,plain,
equalish(sP1_iProver_def,add(c,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_116,c_52]) ).
cnf(c_299,plain,
equalish(add(sP2_iProver_def,a),sP3_iProver_def),
inference(superposition,[status(thm)],[c_118,c_52]) ).
cnf(c_312,plain,
( ~ equalish(add(X0,X1),X2)
| equalish(add(X1,X0),X2) ),
inference(superposition,[status(thm)],[c_52,c_51]) ).
cnf(c_334,plain,
equalish(add(b,add(c,X0)),add(sP2_iProver_def,X0)),
inference(superposition,[status(thm)],[c_117,c_53]) ).
cnf(c_337,plain,
( ~ equalish(add(add(X0,X1),X2),X3)
| equalish(add(X0,add(X1,X2)),X3) ),
inference(superposition,[status(thm)],[c_53,c_51]) ).
cnf(c_362,plain,
( ~ equalish(add(c,sP0_iProver_def),X0)
| equalish(sP1_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_294,c_51]) ).
cnf(c_936,plain,
equalish(add(add(c,X0),b),add(sP2_iProver_def,X0)),
inference(superposition,[status(thm)],[c_334,c_312]) ).
cnf(c_2359,plain,
equalish(add(c,add(X0,b)),add(sP2_iProver_def,X0)),
inference(superposition,[status(thm)],[c_936,c_337]) ).
cnf(c_3085,plain,
equalish(add(c,sP0_iProver_def),add(sP2_iProver_def,a)),
inference(superposition,[status(thm)],[c_115,c_2359]) ).
cnf(c_3117,plain,
equalish(sP1_iProver_def,add(sP2_iProver_def,a)),
inference(superposition,[status(thm)],[c_3085,c_362]) ).
cnf(c_3143,plain,
( ~ equalish(add(sP2_iProver_def,a),X0)
| equalish(sP1_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_3117,c_51]) ).
cnf(c_3604,plain,
equalish(sP1_iProver_def,sP3_iProver_def),
inference(superposition,[status(thm)],[c_299,c_3143]) ).
cnf(c_3612,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3604,c_119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : NUM001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n022.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 19:25:42 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.41/1.12 % SZS status Started for theBenchmark.p
% 3.41/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.41/1.12
% 3.41/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.41/1.12
% 3.41/1.12 ------ iProver source info
% 3.41/1.12
% 3.41/1.12 git: date: 2024-05-02 19:28:25 +0000
% 3.41/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.41/1.12 git: non_committed_changes: false
% 3.41/1.12
% 3.41/1.12 ------ Parsing...successful
% 3.41/1.12
% 3.41/1.12
% 3.41/1.12
% 3.41/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.41/1.12
% 3.41/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.41/1.12
% 3.41/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.41/1.12 ------ Proving...
% 3.41/1.12 ------ Problem Properties
% 3.41/1.12
% 3.41/1.12
% 3.41/1.12 clauses 17
% 3.41/1.12 conjectures 1
% 3.41/1.12 EPR 3
% 3.41/1.12 Horn 17
% 3.41/1.12 unary 12
% 3.41/1.12 binary 0
% 3.41/1.12 lits 27
% 3.41/1.12 lits eq 4
% 3.41/1.12 fd_pure 0
% 3.41/1.12 fd_pseudo 0
% 3.41/1.12 fd_cond 0
% 3.41/1.12 fd_pseudo_cond 0
% 3.41/1.12 AC symbols 0
% 3.41/1.12
% 3.41/1.12 ------ Schedule dynamic 5 is on
% 3.41/1.12
% 3.41/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.41/1.12
% 3.41/1.12
% 3.41/1.12 ------
% 3.41/1.12 Current options:
% 3.41/1.12 ------
% 3.41/1.12
% 3.41/1.12
% 3.41/1.12
% 3.41/1.12
% 3.41/1.12 ------ Proving...
% 3.41/1.12
% 3.41/1.12
% 3.41/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.41/1.12
% 3.41/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.41/1.12
% 3.41/1.12
%------------------------------------------------------------------------------