TSTP Solution File: SYN014-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYN014-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 03:28:36 EDT 2024
% Result : Unsatisfiable 0.48s 1.16s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 18
% Syntax : Number of clauses : 95 ( 10 unt; 76 nHn; 89 RR)
% Number of literals : 317 ( 215 equ; 65 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
m != n,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_1) ).
cnf(c_50,negated_conjecture,
( m = k
| n = k ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_2) ).
cnf(c_51,negated_conjecture,
( X0 != k
| X0 = j
| element(X0,j) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_3) ).
cnf(c_52,negated_conjecture,
( ~ element(X0,j)
| X0 = k
| X0 = j ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_4) ).
cnf(c_53,negated_conjecture,
( f(X0) != m
| ~ element(X0,m)
| X0 = m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_5) ).
cnf(c_54,negated_conjecture,
( f(X0) != X0
| ~ element(X0,m)
| X0 = m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_6) ).
cnf(c_55,negated_conjecture,
( ~ element(X0,m)
| X0 = m
| element(X0,f(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_7) ).
cnf(c_56,negated_conjecture,
( ~ element(X0,m)
| X0 = m
| element(f(X0),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_8) ).
cnf(c_57,negated_conjecture,
( ~ element(X0,X1)
| ~ element(X1,X0)
| X0 = X1
| X0 = m
| X1 = m
| element(X0,m) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_9) ).
cnf(c_58,negated_conjecture,
( g(X0) != n
| X0 = n
| element(X0,n) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_10) ).
cnf(c_59,negated_conjecture,
( g(X0) != X0
| X0 = n
| element(X0,n) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_11) ).
cnf(c_60,negated_conjecture,
( X0 = n
| element(X0,g(X0))
| element(X0,n) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_12) ).
cnf(c_61,negated_conjecture,
( X0 = n
| element(g(X0),X0)
| element(X0,n) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_13) ).
cnf(c_63,negated_conjecture,
( X0 != m
| X0 = k
| element(X0,k) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_15) ).
cnf(c_64,negated_conjecture,
( X0 != n
| X0 = k
| element(X0,k) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_16) ).
cnf(c_65,negated_conjecture,
( ~ element(X0,k)
| X0 = m
| X0 = n
| X0 = k ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_17) ).
cnf(c_66,negated_conjecture,
( n = k
| element(n,k) ),
inference(unflattening,[status(thm)],[c_64]) ).
cnf(c_67,negated_conjecture,
( m = k
| element(m,k) ),
inference(unflattening,[status(thm)],[c_63]) ).
cnf(c_68,negated_conjecture,
( k = j
| element(k,j) ),
inference(unflattening,[status(thm)],[c_51]) ).
cnf(c_287,negated_conjecture,
( k = j
| element(k,j) ),
inference(demodulation,[status(thm)],[c_68]) ).
cnf(c_288,negated_conjecture,
( m = k
| element(m,k) ),
inference(demodulation,[status(thm)],[c_67]) ).
cnf(c_289,negated_conjecture,
( n = k
| element(n,k) ),
inference(demodulation,[status(thm)],[c_66]) ).
cnf(c_290,negated_conjecture,
( ~ element(X0,k)
| X0 = m
| X0 = n
| X0 = k ),
inference(demodulation,[status(thm)],[c_65]) ).
cnf(c_292,negated_conjecture,
( X0 = n
| element(g(X0),X0)
| element(X0,n) ),
inference(demodulation,[status(thm)],[c_61]) ).
cnf(c_293,negated_conjecture,
( X0 = n
| element(X0,g(X0))
| element(X0,n) ),
inference(demodulation,[status(thm)],[c_60]) ).
cnf(c_294,negated_conjecture,
( g(X0) != X0
| X0 = n
| element(X0,n) ),
inference(demodulation,[status(thm)],[c_59]) ).
cnf(c_295,negated_conjecture,
( g(X0) != n
| X0 = n
| element(X0,n) ),
inference(demodulation,[status(thm)],[c_58]) ).
cnf(c_296,negated_conjecture,
( ~ element(X0,X1)
| ~ element(X1,X0)
| X0 = X1
| X0 = m
| X1 = m
| element(X0,m) ),
inference(demodulation,[status(thm)],[c_57]) ).
cnf(c_297,negated_conjecture,
( ~ element(X0,m)
| X0 = m
| element(f(X0),X0) ),
inference(demodulation,[status(thm)],[c_56]) ).
cnf(c_298,negated_conjecture,
( ~ element(X0,m)
| X0 = m
| element(X0,f(X0)) ),
inference(demodulation,[status(thm)],[c_55]) ).
cnf(c_299,negated_conjecture,
( f(X0) != X0
| ~ element(X0,m)
| X0 = m ),
inference(demodulation,[status(thm)],[c_54]) ).
cnf(c_300,negated_conjecture,
( f(X0) != m
| ~ element(X0,m)
| X0 = m ),
inference(demodulation,[status(thm)],[c_53]) ).
cnf(c_301,negated_conjecture,
( ~ element(X0,j)
| X0 = k
| X0 = j ),
inference(demodulation,[status(thm)],[c_52]) ).
cnf(c_302,negated_conjecture,
( m = k
| n = k ),
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_303,negated_conjecture,
m != n,
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_304,plain,
X0 = X0,
theory(equality) ).
cnf(c_306,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_308,plain,
m = m,
inference(instantiation,[status(thm)],[c_304]) ).
cnf(c_567,plain,
( m = k
| element(m,n) ),
inference(superposition,[status(thm)],[c_302,c_288]) ).
cnf(c_568,plain,
( m = k
| k = j
| element(n,j) ),
inference(superposition,[status(thm)],[c_302,c_287]) ).
cnf(c_609,plain,
( g(j) = k
| g(j) = j
| n = j
| element(j,n) ),
inference(superposition,[status(thm)],[c_292,c_301]) ).
cnf(c_662,plain,
( ~ element(X0,n)
| X0 = m
| X0 = n
| X0 = k
| m = k ),
inference(superposition,[status(thm)],[c_302,c_290]) ).
cnf(c_692,plain,
( ~ element(g(X0),X0)
| g(X0) = X0
| g(X0) = m
| X0 = m
| X0 = n
| element(X0,m)
| element(X0,n) ),
inference(superposition,[status(thm)],[c_293,c_296]) ).
cnf(c_848,plain,
( ~ element(n,m)
| f(n) = m
| f(n) = n
| f(n) = k
| m = n
| m = k ),
inference(superposition,[status(thm)],[c_297,c_662]) ).
cnf(c_851,plain,
( g(j) = k
| g(j) = j
| m = k
| m = j
| n = j
| k = j ),
inference(superposition,[status(thm)],[c_609,c_662]) ).
cnf(c_858,plain,
( ~ element(n,m)
| f(n) = m
| f(n) = n
| f(n) = k
| m = k ),
inference(forward_subsumption_resolution,[status(thm)],[c_848,c_303]) ).
cnf(c_864,plain,
( m != X0
| n != X0
| m = n ),
inference(instantiation,[status(thm)],[c_306]) ).
cnf(c_865,plain,
( m != m
| n != m
| m = n ),
inference(instantiation,[status(thm)],[c_864]) ).
cnf(c_891,plain,
( g(j) = k
| m = k
| m = j
| n = j
| k = j
| element(j,n) ),
inference(superposition,[status(thm)],[c_851,c_294]) ).
cnf(c_949,plain,
( f(n) != n
| ~ element(n,m)
| n = m ),
inference(instantiation,[status(thm)],[c_299]) ).
cnf(c_950,plain,
( ~ element(n,m)
| n = m
| element(n,f(n)) ),
inference(instantiation,[status(thm)],[c_298]) ).
cnf(c_951,plain,
( ~ element(n,m)
| n = m
| element(f(n),n) ),
inference(instantiation,[status(thm)],[c_297]) ).
cnf(c_953,plain,
( f(n) != m
| ~ element(n,m)
| n = m ),
inference(instantiation,[status(thm)],[c_300]) ).
cnf(c_956,plain,
( ~ element(n,m)
| f(n) = k
| m = k ),
inference(global_subsumption_just,[status(thm)],[c_858,c_49,c_308,c_858,c_865,c_953,c_949]) ).
cnf(c_988,plain,
( g(j) = k
| m = k
| m = j
| n = j
| k = j ),
inference(superposition,[status(thm)],[c_891,c_662]) ).
cnf(c_1006,plain,
( n != k
| m = k
| m = j
| n = j
| k = j
| element(j,n) ),
inference(superposition,[status(thm)],[c_988,c_295]) ).
cnf(c_1008,plain,
( m = k
| m = j
| n = j
| k = j
| element(j,n)
| element(j,k) ),
inference(superposition,[status(thm)],[c_988,c_293]) ).
cnf(c_1022,plain,
( element(j,n)
| k = j
| n = j
| m = j
| m = k ),
inference(global_subsumption_just,[status(thm)],[c_1008,c_50,c_1006]) ).
cnf(c_1023,plain,
( m = k
| m = j
| n = j
| k = j
| element(j,n) ),
inference(renaming,[status(thm)],[c_1022]) ).
cnf(c_1042,plain,
( m = k
| m = j
| n = j
| k = j ),
inference(superposition,[status(thm)],[c_1023,c_662]) ).
cnf(c_1114,plain,
( g(X0) = m
| X0 = m
| X0 = n
| element(X0,m)
| element(X0,n) ),
inference(global_subsumption_just,[status(thm)],[c_692,c_61,c_59,c_692]) ).
cnf(c_1127,plain,
( ~ element(n,X0)
| g(X0) = m
| X0 = m
| X0 = n
| m = n
| element(X0,m) ),
inference(superposition,[status(thm)],[c_1114,c_296]) ).
cnf(c_1138,plain,
( ~ element(n,X0)
| g(X0) = m
| X0 = m
| X0 = n
| element(X0,m) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1127,c_303]) ).
cnf(c_1167,plain,
( ~ element(n,m)
| g(f(n)) = m
| f(n) = m
| f(n) = n
| m = n
| element(f(n),m) ),
inference(superposition,[status(thm)],[c_298,c_1138]) ).
cnf(c_1172,plain,
( ~ element(n,m)
| g(f(n)) = m
| f(n) = m
| f(n) = n
| element(f(n),m) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1167,c_303]) ).
cnf(c_1193,plain,
( ~ element(X0,k)
| X0 = k
| X0 = j
| m = k
| m = j
| n = j ),
inference(superposition,[status(thm)],[c_1042,c_301]) ).
cnf(c_1227,plain,
( ~ element(m,k)
| m = k
| m = j
| n = j ),
inference(instantiation,[status(thm)],[c_1193]) ).
cnf(c_1232,plain,
( ~ element(n,m)
| g(f(n)) = m
| element(f(n),m) ),
inference(global_subsumption_just,[status(thm)],[c_1172,c_49,c_308,c_865,c_953,c_949,c_1172]) ).
cnf(c_1242,plain,
( m = k
| m = j
| n = j ),
inference(global_subsumption_just,[status(thm)],[c_1193,c_67,c_1227]) ).
cnf(c_1257,plain,
( ~ element(X0,n)
| X0 = k
| X0 = j
| m = k
| m = j ),
inference(superposition,[status(thm)],[c_1242,c_301]) ).
cnf(c_1258,plain,
( m = k
| m = j
| k = j
| element(k,n) ),
inference(superposition,[status(thm)],[c_1242,c_287]) ).
cnf(c_1294,plain,
( ~ element(m,n)
| m = k
| m = j ),
inference(instantiation,[status(thm)],[c_1257]) ).
cnf(c_1298,plain,
( m = k
| m = j ),
inference(global_subsumption_just,[status(thm)],[c_1258,c_567,c_1294]) ).
cnf(c_1308,plain,
( m = k
| k = j
| element(n,m) ),
inference(superposition,[status(thm)],[c_1298,c_568]) ).
cnf(c_1353,plain,
( f(n) = k
| m = k
| k = j ),
inference(superposition,[status(thm)],[c_1308,c_956]) ).
cnf(c_1368,plain,
( n != k
| ~ element(n,m)
| m = n
| m = k
| k = j ),
inference(superposition,[status(thm)],[c_1353,c_299]) ).
cnf(c_1370,plain,
( ~ element(n,m)
| m = n
| m = k
| k = j
| element(k,n) ),
inference(superposition,[status(thm)],[c_1353,c_297]) ).
cnf(c_1377,plain,
( ~ element(n,m)
| m = k
| k = j
| element(k,n) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1370,c_303]) ).
cnf(c_1387,plain,
( n != k
| ~ element(n,m)
| m = k
| k = j ),
inference(forward_subsumption_resolution,[status(thm)],[c_1368,c_303]) ).
cnf(c_1451,plain,
( k = j
| m = k ),
inference(global_subsumption_just,[status(thm)],[c_1377,c_50,c_1308,c_1387]) ).
cnf(c_1452,plain,
( m = k
| k = j ),
inference(renaming,[status(thm)],[c_1451]) ).
cnf(c_1457,plain,
m = k,
inference(superposition,[status(thm)],[c_1298,c_1452]) ).
cnf(c_1470,plain,
( ~ element(X0,m)
| X0 = m
| X0 = n ),
inference(demodulation,[status(thm)],[c_290,c_1457]) ).
cnf(c_1472,plain,
( m = n
| element(n,m) ),
inference(demodulation,[status(thm)],[c_289,c_1457]) ).
cnf(c_1476,plain,
element(n,m),
inference(forward_subsumption_resolution,[status(thm)],[c_1472,c_303]) ).
cnf(c_1477,plain,
( g(f(n)) = m
| element(f(n),m) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1232,c_1476]) ).
cnf(c_1585,plain,
( g(f(n)) = m
| f(n) = m
| f(n) = n ),
inference(superposition,[status(thm)],[c_1477,c_1470]) ).
cnf(c_1618,plain,
g(f(n)) = m,
inference(global_subsumption_just,[status(thm)],[c_1585,c_49,c_308,c_865,c_953,c_949,c_1476,c_1585]) ).
cnf(c_1623,plain,
( f(n) = n
| element(f(n),m)
| element(f(n),n) ),
inference(superposition,[status(thm)],[c_1618,c_293]) ).
cnf(c_1631,plain,
element(f(n),n),
inference(global_subsumption_just,[status(thm)],[c_1623,c_49,c_308,c_865,c_951,c_1476]) ).
cnf(c_1634,plain,
( ~ element(n,f(n))
| f(n) = m
| f(n) = n
| m = n
| element(f(n),m) ),
inference(superposition,[status(thm)],[c_1631,c_296]) ).
cnf(c_1636,plain,
( ~ element(n,f(n))
| f(n) = m
| f(n) = n
| element(f(n),m) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1634,c_303]) ).
cnf(c_1641,plain,
element(f(n),m),
inference(global_subsumption_just,[status(thm)],[c_1636,c_49,c_308,c_865,c_953,c_950,c_949,c_1476,c_1636]) ).
cnf(c_1643,plain,
( f(n) = m
| f(n) = n ),
inference(superposition,[status(thm)],[c_1641,c_1470]) ).
cnf(c_1648,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1643,c_1476,c_949,c_953,c_865,c_308,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN014-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 21:13:20 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 0.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...successful
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 17
% 0.48/1.16 conjectures 17
% 0.48/1.16 EPR 9
% 0.48/1.16 Horn 3
% 0.48/1.16 unary 1
% 0.48/1.16 binary 4
% 0.48/1.16 lits 52
% 0.48/1.16 lits eq 29
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 10
% 0.48/1.16 fd_pseudo_cond 2
% 0.48/1.16 AC symbols 0
% 0.48/1.16
% 0.48/1.16 ------ Schedule dynamic 5 is on
% 0.48/1.16
% 0.48/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.16
% 0.48/1.16
%------------------------------------------------------------------------------