TSTP Solution File: SYO295^5 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SYO295^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n013.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 : Tue May 21 08:56:21 EDT 2024
% Result : Theorem 6.87s 2.33s
% Output : Refutation 6.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO295^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n013.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon May 20 09:36:39 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.94/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.24/0.96 % [INFO] Parsing done (96ms).
% 1.24/0.97 % [INFO] Running in sequential loop mode.
% 1.63/1.17 % [INFO] eprover registered as external prover.
% 1.63/1.18 % [INFO] cvc4 registered as external prover.
% 1.63/1.18 % [INFO] Scanning for conjecture ...
% 1.73/1.23 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.82/1.25 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.82/1.25 % [INFO] Problem is higher-order (TPTP THF).
% 1.82/1.25 % [INFO] Type checking passed.
% 1.82/1.26 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 2.40/1.51 % [INFO] GaveUp with current strategy, trying again with another strategy ...
% 5.32/2.33 % [INFO] Killing All external provers ...
% 6.87/2.33 % Time passed: 1803ms (effective reasoning time: 1358ms)
% 6.87/2.33 % Solved by strategy<name(funcspec),share(0.5),primSubst(2),sos(false),unifierCount(10),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(true), domConstr(0),specialInstances(-1),restrictUniAttempts(false),termOrdering(none)>
% 6.87/2.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1803 ms resp. 1358 ms w/o parsing
% 6.87/2.35 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.87/2.35 thf(b_type, type, b: $i).
% 6.87/2.35 thf(y_type, type, y: $i).
% 6.87/2.35 thf(a_type, type, a: $i).
% 6.87/2.35 thf(x_type, type, x: $i).
% 6.87/2.35 thf(17,axiom,((? [A:(($i > $o) > $i)]: ! [B:($i > $o)]: ((? [C:$i]: (B @ C)) => (B @ (A @ B))))),introduced(axiom_of_choice)).
% 6.87/2.35 thf(19,plain,(! [A:$i] : ((~ (((y = x) => (A = a)) & (A = b))) | (((y = x) => ((@+ [B:$i]: (((y = x) => (B = a)) & (B = b))) = a)) & ((@+ [B:$i]: (((y = x) => (B = a)) & (B = b))) = b)))),inference(choice,[status(esa)],[17])).
% 6.87/2.35 thf(34,plain,(! [A:$i] : (((@+ [B:$i]: (((y = x) => (B = a)) & (B = b))) = b) | (y = x) | (~ (A = b)))),inference(cnf,[status(esa)],[19])).
% 6.87/2.35 thf(39,plain,(! [A:$i] : (((@+ [B:$i]: (((y = x) => (B = a)) & (B = b))) = b) | (y = x) | (A != b))),inference(lifteq,[status(thm)],[34])).
% 6.87/2.35 thf(40,plain,(((@+ [A:$i]: (((y = x) => (A = a)) & (A = b))) = b) | (y = x)),inference(simp,[status(thm)],[39])).
% 6.87/2.35 thf(13,plain,(((@+ [A:$i]: (((x = x) => (A = a)) & ((x = y) => (A = b)))) != a) | ((@+ [A:$i]: (((y = x) => (A = a)) & ((y = y) => (A = b)))) != b)),introduced(choice instance)).
% 6.87/2.35 thf(14,plain,(((@+ [A:$i]: ((A = a) & ((x = y) => (A = b)))) != a) | ((@+ [A:$i]: (((y = x) => (A = a)) & (A = b))) != b)),inference(simp,[status(thm)],[13])).
% 6.87/2.35 thf(18,plain,(! [A:$i] : ((~ ((A = a) & ((x = y) => (A = b)))) | (((@+ [B:$i]: ((B = a) & ((x = y) => (B = b)))) = a) & ((x = y) => ((@+ [B:$i]: ((B = a) & ((x = y) => (B = b)))) = b))))),inference(choice,[status(esa)],[17])).
% 6.87/2.35 thf(24,plain,(! [A:$i] : (((@+ [B:$i]: ((B = a) & ((x = y) => (B = b)))) = a) | (~ (A = a)) | (x = y))),inference(cnf,[status(esa)],[18])).
% 6.87/2.35 thf(31,plain,(! [A:$i] : (((@+ [B:$i]: ((B = a) & ((x = y) => (B = b)))) = a) | (A != a) | (x = y))),inference(lifteq,[status(thm)],[24])).
% 6.87/2.35 thf(32,plain,(((@+ [A:$i]: ((A = a) & ((x = y) => (A = b)))) = a) | (x = y)),inference(simp,[status(thm)],[31])).
% 6.87/2.35 thf(1,conjecture,(((x != y) => (? [A:($i > $i)]: (((A @ x) = a) & ((A @ y) = b))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5311)).
% 6.87/2.35 thf(2,negated_conjecture,((~ ((x != y) => (? [A:($i > $i)]: (((A @ x) = a) & ((A @ y) = b)))))),inference(neg_conjecture,[status(cth)],[1])).
% 6.87/2.35 thf(3,plain,((~ ((~ (x = y)) => (? [A:($i > $i)]: (((A @ x) = a) & ((A @ y) = b)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[2])).
% 6.87/2.35 thf(5,plain,((~ (x = y))),inference(cnf,[status(esa)],[3])).
% 6.87/2.35 thf(10,plain,((x != y)),inference(lifteq,[status(thm)],[5])).
% 6.87/2.35 thf(53,plain,(((@+ [A:$i]: ((A = a) & ((x = y) => (A = b)))) = a)),inference(simplifyReflect,[status(thm)],[32,10])).
% 6.87/2.35 thf(55,plain,(((@+ [A:$i]: (((y = x) => (A = a)) & (A = b))) != b)),inference(simplifyReflect,[status(thm)],[14,53])).
% 6.87/2.35 thf(438,plain,(($false)),inference(simplifyReflect,[status(thm)],[40,55,10])).
% 6.87/2.35 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.87/2.35 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------