TSTP Solution File: NUM891_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM891_1 : TPTP v8.1.2. Released v5.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:51:01 EDT 2024
% Result : Theorem 0.99s 1.10s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUM891_1 : TPTP v8.1.2. Released v5.0.0.
% 0.05/0.11 % 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:16:57 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running TFA theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --no_cores 8 --schedule casc_29_tfa --heuristic_context casc_unsat /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.99/1.10 % SZS status Started for theBenchmark.p
% 0.99/1.10 % SZS status Theorem for theBenchmark.p
% 0.99/1.10
% 0.99/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.99/1.10
% 0.99/1.10 ------ iProver source info
% 0.99/1.10
% 0.99/1.10 git: date: 2024-05-02 19:28:25 +0000
% 0.99/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.99/1.10 git: non_committed_changes: false
% 0.99/1.10
% 0.99/1.10 ------ Parsing...
% 0.99/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.99/1.10
% 0.99/1.10 ------ Preprocessing...
% 0.99/1.10
% 0.99/1.10 % SZS status Theorem for theBenchmark.p
% 0.99/1.10
% 0.99/1.10 % SZS output start CNFRefutation for theBenchmark.p
% 0.99/1.10
% 0.99/1.10 tff(f1,conjecture,(
% 0.99/1.10 ! [X0 : $int] : ($uminus(X0) = X0 <=> 0 = X0)),
% 0.99/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p',uminus_equal)).
% 0.99/1.10
% 0.99/1.10 tff(f2,negated_conjecture,(
% 0.99/1.10 ~! [X0 : $int] : ($uminus(X0) = X0 <=> 0 = X0)),
% 0.99/1.10 inference(negated_conjecture,[],[f1])).
% 0.99/1.10
% 0.99/1.10 tff(f15,plain,(
% 0.99/1.10 ? [X0 : $int] : ($uminus(X0) = X0 <~> 0 = X0)),
% 0.99/1.10 inference(ennf_transformation,[],[f2])).
% 0.99/1.10
% 0.99/1.10 tff(f16,plain,(
% 0.99/1.10 ? [X0 : $int] : ((0 != X0 | $uminus(X0) != X0) & (0 = X0 | $uminus(X0) = X0))),
% 0.99/1.10 inference(nnf_transformation,[],[f15])).
% 0.99/1.10
% 0.99/1.10 tff(f17,plain,(
% 0.99/1.10 ? [X0 : $int] : ((0 != X0 | $uminus(X0) != X0) & (0 = X0 | $uminus(X0) = X0)) => ((0 != sK0 | sK0 != $uminus(sK0)) & (0 = sK0 | sK0 = $uminus(sK0)))),
% 0.99/1.10 introduced(choice_axiom,[])).
% 0.99/1.10
% 0.99/1.10 tff(f18,plain,(
% 0.99/1.10 (0 != sK0 | sK0 != $uminus(sK0)) & (0 = sK0 | sK0 = $uminus(sK0))),
% 0.99/1.10 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f16,f17])).
% 0.99/1.10
% 0.99/1.10 tff(f19,plain,(
% 0.99/1.10 0 = sK0 | sK0 = $uminus(sK0)),
% 0.99/1.10 inference(cnf_transformation,[],[f18])).
% 0.99/1.10
% 0.99/1.10 tff(f20,plain,(
% 0.99/1.10 0 != sK0 | sK0 != $uminus(sK0)),
% 0.99/1.10 inference(cnf_transformation,[],[f18])).
% 0.99/1.10
% 0.99/1.10 cnf(c_61,negated_conjecture,
% 0.99/1.10 ($uminus_int(sK0) != sK0|sK0 != 0),
% 0.99/1.10 inference(cnf_transformation,[],[f20])).
% 0.99/1.10
% 0.99/1.10 cnf(c_62,negated_conjecture,
% 0.99/1.10 ($uminus_int(sK0) = sK0|sK0 = 0),
% 0.99/1.10 inference(cnf_transformation,[],[f19])).
% 0.99/1.10
% 0.99/1.10 cnf(c_77,plain,
% 0.99/1.10 (sK0 != 0|$uminus_int(sK0) != sK0),
% 0.99/1.10 inference(prop_impl_just,[status(thm)],[c_61])).
% 0.99/1.10
% 0.99/1.10 cnf(c_78,plain,
% 0.99/1.10 ($uminus_int(sK0) != sK0|sK0 != 0),
% 0.99/1.10 inference(renaming,[status(thm)],[c_77])).
% 0.99/1.10
% 0.99/1.10 cnf(c_79,plain,
% 0.99/1.10 (sK0 = 0|$uminus_int(sK0) = sK0),
% 0.99/1.10 inference(prop_impl_just,[status(thm)],[c_62])).
% 0.99/1.10
% 0.99/1.10 cnf(c_80,plain,
% 0.99/1.10 ($uminus_int(sK0) = sK0|sK0 = 0),
% 0.99/1.10 inference(renaming,[status(thm)],[c_79])).
% 0.99/1.10
% 0.99/1.10 cnf(c_161,plain,
% 0.99/1.10 (sK0 = 0),
% 0.99/1.10 inference(smt_theory_normalisation,[status(thm)],[c_80])).
% 0.99/1.10
% 0.99/1.10 cnf(c_177,plain,
% 0.99/1.10 (sK0 != 0),
% 0.99/1.10 inference(smt_theory_normalisation,[status(thm)],[c_78])).
% 0.99/1.10
% 0.99/1.10 cnf(c_178,plain,
% 0.99/1.10 (sK0 != sK0),
% 0.99/1.10 inference(demodulation,[status(thm)],[c_177,c_161])).
% 0.99/1.10
% 0.99/1.10 cnf(c_179,plain,
% 0.99/1.10 ($false),
% 0.99/1.10 inference(equality_resolution_simp,[status(thm)],[c_178])).
% 0.99/1.10
% 0.99/1.10
% 0.99/1.10 % SZS output end CNFRefutation for theBenchmark.p
% 0.99/1.10
% 0.99/1.10
%------------------------------------------------------------------------------