TSTP Solution File: ALG200+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ALG200+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:04:14 EDT 2024
% Result : Theorem 1.19s 0.94s
% Output : CNFRefutation 1.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 15 unt; 0 def)
% Number of atoms : 92 ( 91 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 110 ( 38 ~; 48 |; 24 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,conjecture,
~ ( ( e6 != op(e6,e6)
| e5 != op(e5,e5)
| e4 != op(e4,e4)
| e3 != op(e3,e3)
| e2 != op(e2,e2)
| e1 != op(e1,e1)
| e0 != op(e0,e0) )
& ( e6 = op(e6,e6)
| e5 = op(e5,e5)
| e4 = op(e4,e4)
| e3 = op(e3,e3)
| e2 = op(e2,e2)
| e1 = op(e1,e1)
| e0 = op(e0,e0) )
& e6 = op(e6,e6)
& e5 = op(e5,e5)
& e4 = op(e4,e4)
& e3 = op(e3,e3)
& e2 = op(e2,e2)
& e1 = op(e1,e1)
& e0 = op(e0,e0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f8,negated_conjecture,
~ ~ ( ( e6 != op(e6,e6)
| e5 != op(e5,e5)
| e4 != op(e4,e4)
| e3 != op(e3,e3)
| e2 != op(e2,e2)
| e1 != op(e1,e1)
| e0 != op(e0,e0) )
& ( e6 = op(e6,e6)
| e5 = op(e5,e5)
| e4 = op(e4,e4)
| e3 = op(e3,e3)
| e2 = op(e2,e2)
| e1 = op(e1,e1)
| e0 = op(e0,e0) )
& e6 = op(e6,e6)
& e5 = op(e5,e5)
& e4 = op(e4,e4)
& e3 = op(e3,e3)
& e2 = op(e2,e2)
& e1 = op(e1,e1)
& e0 = op(e0,e0) ),
inference(negated_conjecture,[],[f7]) ).
fof(f9,plain,
( ( e6 != op(e6,e6)
| e5 != op(e5,e5)
| e4 != op(e4,e4)
| e3 != op(e3,e3)
| e2 != op(e2,e2)
| e1 != op(e1,e1)
| e0 != op(e0,e0) )
& ( e6 = op(e6,e6)
| e5 = op(e5,e5)
| e4 = op(e4,e4)
| e3 = op(e3,e3)
| e2 = op(e2,e2)
| e1 = op(e1,e1)
| e0 = op(e0,e0) )
& e6 = op(e6,e6)
& e5 = op(e5,e5)
& e4 = op(e4,e4)
& e3 = op(e3,e3)
& e2 = op(e2,e2)
& e1 = op(e1,e1)
& e0 = op(e0,e0) ),
inference(flattening,[],[f8]) ).
fof(f526,plain,
e0 = op(e0,e0),
inference(cnf_transformation,[],[f9]) ).
fof(f527,plain,
e1 = op(e1,e1),
inference(cnf_transformation,[],[f9]) ).
fof(f528,plain,
e2 = op(e2,e2),
inference(cnf_transformation,[],[f9]) ).
fof(f529,plain,
e3 = op(e3,e3),
inference(cnf_transformation,[],[f9]) ).
fof(f530,plain,
e4 = op(e4,e4),
inference(cnf_transformation,[],[f9]) ).
fof(f531,plain,
e5 = op(e5,e5),
inference(cnf_transformation,[],[f9]) ).
fof(f532,plain,
e6 = op(e6,e6),
inference(cnf_transformation,[],[f9]) ).
fof(f534,plain,
( e6 != op(e6,e6)
| e5 != op(e5,e5)
| e4 != op(e4,e4)
| e3 != op(e3,e3)
| e2 != op(e2,e2)
| e1 != op(e1,e1)
| e0 != op(e0,e0) ),
inference(cnf_transformation,[],[f9]) ).
cnf(c_565,negated_conjecture,
( op(e6,e6) != e6
| op(e5,e5) != e5
| op(e4,e4) != e4
| op(e3,e3) != e3
| op(e2,e2) != e2
| op(e1,e1) != e1
| op(e0,e0) != e0 ),
inference(cnf_transformation,[],[f534]) ).
cnf(c_567,negated_conjecture,
op(e6,e6) = e6,
inference(cnf_transformation,[],[f532]) ).
cnf(c_568,negated_conjecture,
op(e5,e5) = e5,
inference(cnf_transformation,[],[f531]) ).
cnf(c_569,negated_conjecture,
op(e4,e4) = e4,
inference(cnf_transformation,[],[f530]) ).
cnf(c_570,negated_conjecture,
op(e3,e3) = e3,
inference(cnf_transformation,[],[f529]) ).
cnf(c_571,negated_conjecture,
op(e2,e2) = e2,
inference(cnf_transformation,[],[f528]) ).
cnf(c_572,negated_conjecture,
op(e1,e1) = e1,
inference(cnf_transformation,[],[f527]) ).
cnf(c_573,negated_conjecture,
op(e0,e0) = e0,
inference(cnf_transformation,[],[f526]) ).
cnf(c_574,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_565,c_567,c_568,c_569,c_570,c_571,c_572,c_573]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : ALG200+1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/0.07 % Command : run_iprover %s %d THM
% 0.07/0.26 % Computer : n016.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Thu May 2 23:22:15 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.10/0.33 Running first-order theorem proving
% 0.10/0.33 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
% 1.19/0.94 % SZS status Started for theBenchmark.p
% 1.19/0.94 % SZS status Theorem for theBenchmark.p
% 1.19/0.94
% 1.19/0.94 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.19/0.94
% 1.19/0.94 ------ iProver source info
% 1.19/0.94
% 1.19/0.94 git: date: 2024-05-02 19:28:25 +0000
% 1.19/0.94 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.19/0.94 git: non_committed_changes: false
% 1.19/0.94
% 1.19/0.94 ------ Parsing...
% 1.19/0.94 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.19/0.94
% 1.19/0.94 ------ Preprocessing...
% 1.19/0.94
% 1.19/0.94 % SZS status Theorem for theBenchmark.p
% 1.19/0.94
% 1.19/0.94 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.19/0.94
% 1.19/0.94
%------------------------------------------------------------------------------