TSTP Solution File: SYN392+1 by Goeland---1.0.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Goeland---1.0.0
% Problem : SYN392+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : goeland -dmt -presko -proof %s
% Computer : n029.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 : Thu Sep 29 22:23:19 EDT 2022
% Result : Theorem 0.12s 0.36s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN392+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % Command : goeland -dmt -presko -proof %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Sep 5 03:14:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 [DMT] DMT loaded with preskolemization
% 0.12/0.35 [EQ] equality loaded.
% 0.12/0.35 [0.000041s][1][MAIN] Problem : theBenchmark.p
% 0.12/0.35 Start search
% 0.12/0.35 nb_step : 1 - limit : 0
% 0.12/0.35 Launch Gotab with destructive = true
% 0.12/0.36 % SZS output start Proof for theBenchmark.p
% 0.12/0.36 [0] BETA_NOT_EQUIV : ~((p1 <=> p2) <=> ((p2 | ~p1) & (~p2 | p1)))
% 0.12/0.36 -> [1] ~(p1 <=> p2), ((p2 | ~p1) & (~p2 | p1))
% 0.12/0.36 -> [2] (p1 <=> p2), ~((p2 | ~p1) & (~p2 | p1))
% 0.12/0.36
% 0.12/0.36 [1] ALPHA_AND : ((p2 | ~p1) & (~p2 | p1))
% 0.12/0.36 -> [5] (p2 | ~p1), (~p2 | p1)
% 0.12/0.36
% 0.12/0.36 [5] BETA_NOT_EQUIV : ~(p1 <=> p2)
% 0.12/0.36 -> [6] ~p1, p2
% 0.12/0.36 -> [7] p1, ~p2
% 0.12/0.36
% 0.12/0.36 [7] BETA_OR : (p2 | ~p1)
% 0.12/0.36 -> [8] p2
% 0.12/0.36 -> [9] ~p1
% 0.12/0.36
% 0.12/0.36 [8] CLOSURE : p2
% 0.12/0.36
% 0.12/0.36 [9] CLOSURE : ~p1
% 0.12/0.36
% 0.12/0.36 [6] BETA_OR : (p2 | ~p1)
% 0.12/0.36 -> [12] p2
% 0.12/0.36 -> [13] ~p1
% 0.12/0.36
% 0.12/0.36 [13] BETA_OR : (~p2 | p1)
% 0.12/0.36 -> [18] ~p2
% 0.12/0.36 -> [19] p1
% 0.12/0.36
% 0.12/0.36 [18] CLOSURE : ~p2
% 0.12/0.36
% 0.12/0.36 [19] CLOSURE : p1
% 0.12/0.36
% 0.12/0.36 [12] BETA_OR : (~p2 | p1)
% 0.12/0.36 -> [22] ~p2
% 0.12/0.36 -> [23] p1
% 0.12/0.36
% 0.12/0.36 [22] CLOSURE : ~p2
% 0.12/0.36
% 0.12/0.36 [23] CLOSURE : p1
% 0.12/0.36
% 0.12/0.36 [2] BETA_EQUIV : (p1 <=> p2)
% 0.12/0.36 -> [3] ~p1, ~p2
% 0.12/0.36 -> [4] p1, p2
% 0.12/0.36
% 0.12/0.36 [3] BETA_NOT_AND : ~((p2 | ~p1) & (~p2 | p1))
% 0.12/0.36 -> [10] ~(p2 | ~p1)
% 0.12/0.36 -> [11] ~(~p2 | p1)
% 0.12/0.36
% 0.12/0.36 [10] ALPHA_NOT_OR : ~(p2 | ~p1)
% 0.12/0.36 -> [14] ~p2, ~~p1
% 0.12/0.36
% 0.12/0.36 [14] ALPHA_NOT_NOT : ~~p1
% 0.12/0.36 -> [15] p1
% 0.12/0.36
% 0.12/0.36 [15] CLOSURE : p1
% 0.12/0.36
% 0.12/0.36 [11] ALPHA_NOT_OR : ~(~p2 | p1)
% 0.12/0.36 -> [16] ~~p2, ~p1
% 0.12/0.36
% 0.12/0.36 [16] ALPHA_NOT_NOT : ~~p2
% 0.12/0.36 -> [17] p2
% 0.12/0.36
% 0.12/0.36 [17] CLOSURE : p2
% 0.12/0.36
% 0.12/0.36 [4] BETA_NOT_AND : ~((p2 | ~p1) & (~p2 | p1))
% 0.12/0.36 -> [20] ~(p2 | ~p1)
% 0.12/0.36 -> [21] ~(~p2 | p1)
% 0.12/0.36
% 0.12/0.36 [20] ALPHA_NOT_OR : ~(p2 | ~p1)
% 0.12/0.36 -> [24] ~p2, ~~p1
% 0.12/0.36
% 0.12/0.36 [24] CLOSURE : ~p2
% 0.12/0.36
% 0.12/0.36 [21] ALPHA_NOT_OR : ~(~p2 | p1)
% 0.12/0.36 -> [25] ~~p2, ~p1
% 0.12/0.36
% 0.12/0.36 [25] CLOSURE : ~p1
% 0.12/0.36
% 0.12/0.36 % SZS output end Proof for theBenchmark.p
% 0.12/0.36 [0.011267s][1][Res] 31 goroutines created
% 0.12/0.36 ==== Result ====
% 0.12/0.36 [0.011327s][1][Res] VALID
% 0.12/0.36 % SZS status Theorem for theBenchmark.p
%------------------------------------------------------------------------------