TSTP Solution File: CSR051-10 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : CSR051-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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 : Fri Jul 15 23:24:41 EDT 2022
% Result : Unsatisfiable 54.26s 54.44s
% Output : Refutation 54.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 10 RR)
% Number of literals : 10 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(ifeq4(u,u,v,w),v),
file('CSR051-10.p',unknown),
[] ).
cnf(2,axiom,
equal(ifeq3(u,u,v,w),v),
file('CSR051-10.p',unknown),
[] ).
cnf(3138,axiom,
equal(ifeq4(mtvisible(c_tptp_member3356_mt),true__dfg,marriagelicensedocument(c_tptpmarriagelicensedocument),true__dfg),true__dfg),
file('CSR051-10.p',unknown),
[] ).
cnf(8010,axiom,
equal(mtvisible(c_tptp_member3356_mt),true__dfg),
file('CSR051-10.p',unknown),
[] ).
cnf(8011,axiom,
equal(ifeq3(marriagelicensedocument(u),true__dfg,a,b),b),
file('CSR051-10.p',unknown),
[] ).
cnf(8012,axiom,
~ equal(b,a),
file('CSR051-10.p',unknown),
[] ).
cnf(8013,plain,
equal(marriagelicensedocument(c_tptpmarriagelicensedocument),true__dfg),
inference(rew,[status(thm),theory(equality)],[1,3138,8010]),
[iquote('0:Rew:1.0,3138.0,8010.0,3138.0')] ).
cnf(10481,plain,
equal(ifeq3(true__dfg,true__dfg,a,b),b),
inference(spr,[status(thm),theory(equality)],[8013,8011]),
[iquote('0:SpR:8013.0,8011.0')] ).
cnf(10482,plain,
equal(b,a),
inference(rew,[status(thm),theory(equality)],[2,10481]),
[iquote('0:Rew:2.0,10481.0')] ).
cnf(10483,plain,
$false,
inference(mrr,[status(thm)],[10482,8012]),
[iquote('0:MRR:10482.0,8012.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR051-10 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.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 : Thu Jun 9 22:58:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 54.26/54.44
% 54.26/54.44 SPASS V 3.9
% 54.26/54.44 SPASS beiseite: Proof found.
% 54.26/54.44 % SZS status Theorem
% 54.26/54.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 54.26/54.44 SPASS derived 2458 clauses, backtracked 0 clauses, performed 0 splits and kept 7351 clauses.
% 54.26/54.44 SPASS allocated 74552 KBytes.
% 54.26/54.44 SPASS spent 0:0:49.41 on the problem.
% 54.26/54.44 0:00:01.04 for the input.
% 54.26/54.44 0:00:00.00 for the FLOTTER CNF translation.
% 54.26/54.44 0:00:00.74 for inferences.
% 54.26/54.44 0:00:00.00 for the backtracking.
% 54.26/54.44 0:0:25.87 for the reduction.
% 54.26/54.44
% 54.26/54.44
% 54.26/54.44 Here is a proof with depth 1, length 10 :
% 54.26/54.44 % SZS output start Refutation
% See solution above
% 54.26/54.44 Formulae used in the proof : ifeq_axiom ifeq_axiom_001 ax2_3147 query151 query151_1 goal
% 54.26/54.44
%------------------------------------------------------------------------------