TSTP Solution File: SYN349-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN349-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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 : 600s
% DateTime : Thu Jul 21 12:20:37 EDT 2022
% Result : Unsatisfiable 0.18s 0.40s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 3 unt; 7 nHn; 15 RR)
% Number of literals : 40 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ f(w__dfg(u),g(u,v))
| f(u,g(u,v)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ f(u,g(u,v))
| f(w__dfg(u),g(u,v)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ f(u,g(v,u))
| ~ f(v,g(v,u))
| f(g(v,u),u)
| f(g(v,u),w__dfg(v)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(5,axiom,
( f(u,g(v,u))
| f(v,g(v,u))
| f(g(v,u),u)
| f(g(v,u),w__dfg(v)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ f(g(u,v),v)
| ~ f(g(u,v),w__dfg(u))
| f(v,g(u,v))
| f(u,g(u,v)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ f(u,g(v,u))
| ~ f(v,g(v,u))
| ~ f(g(v,u),u)
| ~ f(g(v,u),w__dfg(v)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(12,plain,
( f(w__dfg(u),g(u,w__dfg(u)))
| f(u,g(u,w__dfg(u)))
| f(g(u,w__dfg(u)),w__dfg(u)) ),
inference(fac,[status(thm)],[5]),
[iquote('0:Fac:5.2,5.3')] ).
cnf(13,plain,
( f(u,g(u,w__dfg(u)))
| f(g(u,w__dfg(u)),w__dfg(u)) ),
inference(mrr,[status(thm)],[12,1]),
[iquote('0:MRR:12.0,1.0')] ).
cnf(14,plain,
( ~ f(u,g(u,w__dfg(u)))
| ~ f(u,g(u,w__dfg(u)))
| f(g(u,w__dfg(u)),w__dfg(u))
| f(g(u,w__dfg(u)),w__dfg(u)) ),
inference(res,[status(thm),theory(equality)],[2,3]),
[iquote('0:Res:2.1,3.0')] ).
cnf(15,plain,
( ~ f(u,g(u,w__dfg(u)))
| f(g(u,w__dfg(u)),w__dfg(u)) ),
inference(obv,[status(thm),theory(equality)],[14]),
[iquote('0:Obv:14.2')] ).
cnf(16,plain,
f(g(u,w__dfg(u)),w__dfg(u)),
inference(mrr,[status(thm)],[15,13]),
[iquote('0:MRR:15.0,13.0')] ).
cnf(23,plain,
( ~ f(g(u,w__dfg(u)),w__dfg(u))
| f(w__dfg(u),g(u,w__dfg(u)))
| f(u,g(u,w__dfg(u))) ),
inference(res,[status(thm),theory(equality)],[16,8]),
[iquote('0:Res:16.0,8.1')] ).
cnf(24,plain,
f(u,g(u,w__dfg(u))),
inference(mrr,[status(thm)],[23,16,1]),
[iquote('0:MRR:23.0,23.1,16.0,1.0')] ).
cnf(27,plain,
( ~ f(w__dfg(u),g(u,w__dfg(u)))
| ~ f(u,g(u,w__dfg(u)))
| ~ f(g(u,w__dfg(u)),w__dfg(u)) ),
inference(res,[status(thm),theory(equality)],[16,10]),
[iquote('0:Res:16.0,10.3')] ).
cnf(28,plain,
$false,
inference(mrr,[status(thm)],[27,2,24,16]),
[iquote('0:MRR:27.0,27.1,27.2,2.1,24.0,16.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN349-1 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 12:52:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.40
% 0.18/0.40 SPASS V 3.9
% 0.18/0.40 SPASS beiseite: Proof found.
% 0.18/0.40 % SZS status Theorem
% 0.18/0.40 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.40 SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.18/0.40 SPASS allocated 63100 KBytes.
% 0.18/0.40 SPASS spent 0:00:00.06 on the problem.
% 0.18/0.40 0:00:00.03 for the input.
% 0.18/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40 0:00:00.00 for inferences.
% 0.18/0.40 0:00:00.00 for the backtracking.
% 0.18/0.40 0:00:00.00 for the reduction.
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Here is a proof with depth 2, length 15 :
% 0.18/0.40 % SZS output start Refutation
% See solution above
% 0.18/0.40 Formulae used in the proof : clause1 clause2 clause3 clause5 clause8 clause10
% 0.18/0.40
%------------------------------------------------------------------------------