TSTP Solution File: AGT017+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : AGT017+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n001.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 : Wed Aug 30 15:55:44 EDT 2023
% Result : Theorem 9.36s 1.60s
% Output : Proof 9.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : AGT017+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.00/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.12/0.33 % Computer : n001.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 : 300
% 0.12/0.33 % DateTime : Sun Aug 27 17:57:03 EDT 2023
% 0.12/0.34 % CPUTime :
% 9.36/1.60 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 9.36/1.60
% 9.36/1.60 % SZS status Theorem
% 9.36/1.60
% 9.36/1.60 % SZS output start Proof
% 9.36/1.60 Take the following subset of the input axioms:
% 9.36/1.60 fof(a1_5, axiom, ![C, L, A2]: (any_agent_in_all_proposed_teams(A2, L, C) => accept_leader(A2, L))).
% 9.36/1.60 fof(a1_6, axiom, ![A, C2, L2]: (the_agent_not_in_any_proposed_teams(A, L2, C2) => ~(accept_city(A, C2) & accept_leader(A, L2)))).
% 9.36/1.60 fof(event_11, axiom, the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization, countryacivilorganization, towna)).
% 9.36/1.60 fof(event_12, axiom, any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization, countryacivilorganization, towna)).
% 9.36/1.60 fof(less_property, axiom, ![X, Y]: (less(X, Y) <=> (~less(Y, X) & Y!=X))).
% 9.36/1.60 fof(query_17, conjecture, ?[X2]: ~accept_city(muslimcountrybhumanitarianorganization, X2)).
% 9.36/1.60
% 9.36/1.60 Now clausify the problem and encode Horn clauses using encoding 3 of
% 9.36/1.60 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 9.36/1.60 We repeatedly replace C & s=t => u=v by the two clauses:
% 9.36/1.60 fresh(y, y, x1...xn) = u
% 9.36/1.60 C => fresh(s, t, x1...xn) = v
% 9.36/1.60 where fresh is a fresh function symbol and x1..xn are the free
% 9.36/1.60 variables of u and v.
% 9.36/1.60 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 9.36/1.60 input problem has no model of domain size 1).
% 9.36/1.60
% 9.36/1.60 The encoding turns the above axioms into the following unit equations and goals:
% 9.36/1.60
% 9.36/1.60 Axiom 1 (query_17): accept_city(muslimcountrybhumanitarianorganization, X) = true2.
% 9.36/1.60 Axiom 2 (event_12): any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization, countryacivilorganization, towna) = true2.
% 9.36/1.60 Axiom 3 (event_11): the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization, countryacivilorganization, towna) = true2.
% 9.36/1.60 Axiom 4 (a1_5): fresh82(X, X, Y, Z) = true2.
% 9.36/1.60 Axiom 5 (a1_5): fresh82(any_agent_in_all_proposed_teams(X, Y, Z), true2, X, Y) = accept_leader(X, Y).
% 9.36/1.60
% 9.36/1.60 Goal 1 (a1_6): tuple(accept_city(X, Y), accept_leader(X, Z), the_agent_not_in_any_proposed_teams(X, Z, Y)) = tuple(true2, true2, true2).
% 9.36/1.60 The goal is true when:
% 9.36/1.60 X = muslimcountrybhumanitarianorganization
% 9.36/1.60 Y = towna
% 9.36/1.60 Z = countryacivilorganization
% 9.36/1.60
% 9.36/1.60 Proof:
% 9.36/1.60 tuple(accept_city(muslimcountrybhumanitarianorganization, towna), accept_leader(muslimcountrybhumanitarianorganization, countryacivilorganization), the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization, countryacivilorganization, towna))
% 9.36/1.60 = { by axiom 3 (event_11) }
% 9.36/1.60 tuple(accept_city(muslimcountrybhumanitarianorganization, towna), accept_leader(muslimcountrybhumanitarianorganization, countryacivilorganization), true2)
% 9.36/1.60 = { by axiom 1 (query_17) }
% 9.36/1.60 tuple(true2, accept_leader(muslimcountrybhumanitarianorganization, countryacivilorganization), true2)
% 9.36/1.60 = { by axiom 5 (a1_5) R->L }
% 9.36/1.60 tuple(true2, fresh82(any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization, countryacivilorganization, towna), true2, muslimcountrybhumanitarianorganization, countryacivilorganization), true2)
% 9.36/1.60 = { by axiom 2 (event_12) }
% 9.36/1.60 tuple(true2, fresh82(true2, true2, muslimcountrybhumanitarianorganization, countryacivilorganization), true2)
% 9.36/1.60 = { by axiom 4 (a1_5) }
% 9.36/1.60 tuple(true2, true2, true2)
% 9.36/1.60 % SZS output end Proof
% 9.36/1.60
% 9.36/1.60 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------