TSTP Solution File: PUZ027-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ027-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n023.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 : Mon Jul 18 18:10:59 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : PUZ027-1 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n023.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 : Sat May 28 20:31:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.12/0.36 # and selection function SelectNewComplexAHP.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 32 Number of unprocessed: 32
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 32 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 4 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 28 extension rule candidate clauses
% 0.12/0.36 # 4 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 37 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 37 tableaux to operate on
% 0.12/0.37 # There were 4 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 4 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 4 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_41, plain, (a_truth(not_lower(X1,X1)))).
% 0.12/0.37 cnf(i_0_53, hypothesis, (a_truth(says(a,lower(a,b))))).
% 0.12/0.37 cnf(i_0_54, hypothesis, (a_truth(says(b,not_lower(a,b))))).
% 0.12/0.37 cnf(i_0_64, negated_conjecture, (~answer(X1))).
% 0.12/0.37 cnf(i_0_35, plain, (~a_truth(truthteller(X1))|~a_truth(liar(X1)))).
% 0.12/0.37 cnf(i_0_34, plain, (~a_truth(truthteller(X1))|~a_truth(normal(X1)))).
% 0.12/0.37 cnf(i_0_36, plain, (~a_truth(liar(X1))|~a_truth(normal(X1)))).
% 0.12/0.37 cnf(i_0_55, hypothesis, (~a_truth(truthteller(a))|~a_truth(truthteller(b)))).
% 0.12/0.37 cnf(i_0_56, hypothesis, (~a_truth(truthteller(a))|~a_truth(normal(b)))).
% 0.12/0.37 cnf(i_0_46, plain, (~a_truth(lower(X1,X2))|~a_truth(truthteller(X1)))).
% 0.12/0.37 cnf(i_0_49, plain, (~a_truth(lower(X1,X2))|~a_truth(liar(X2)))).
% 0.12/0.37 cnf(i_0_42, plain, (~a_truth(not_lower(X1,X2))|~a_truth(lower(X1,X2)))).
% 0.12/0.37 cnf(i_0_38, plain, (~a_truth(says(X1,X2))|~a_truth(liar(X1))|~a_truth(X2))).
% 0.12/0.37 cnf(i_0_57, hypothesis, (~a_truth(truthteller(a))|~a_truth(liar(b)))).
% 0.12/0.37 cnf(i_0_58, hypothesis, (~a_truth(truthteller(b))|~a_truth(normal(a)))).
% 0.12/0.37 cnf(i_0_59, hypothesis, (~a_truth(normal(a))|~a_truth(normal(b)))).
% 0.12/0.37 cnf(i_0_60, hypothesis, (~a_truth(liar(b))|~a_truth(normal(a)))).
% 0.12/0.37 cnf(i_0_61, hypothesis, (~a_truth(truthteller(b))|~a_truth(liar(a)))).
% 0.12/0.37 cnf(i_0_62, hypothesis, (~a_truth(liar(a))|~a_truth(normal(b)))).
% 0.12/0.37 cnf(i_0_63, hypothesis, (~a_truth(liar(a))|~a_truth(liar(b)))).
% 0.12/0.37 cnf(i_0_37, plain, (a_truth(X1)|~a_truth(says(X2,X1))|~a_truth(truthteller(X2)))).
% 0.12/0.37 cnf(i_0_45, plain, (a_truth(truthteller(X1))|~a_truth(lower(X2,X1))|~a_truth(normal(X2)))).
% 0.12/0.37 cnf(i_0_48, plain, (a_truth(liar(X1))|~a_truth(lower(X1,X2))|~a_truth(normal(X2)))).
% 0.12/0.37 cnf(i_0_43, plain, (a_truth(lower(X1,X2))|a_truth(not_lower(X1,X2)))).
% 0.12/0.37 cnf(i_0_33, plain, (a_truth(normal(X1))|a_truth(liar(X1))|a_truth(truthteller(X1)))).
% 0.12/0.37 cnf(i_0_39, plain, (a_truth(normal(X1))|a_truth(truthteller(X1))|~a_truth(says(X1,X2))|~a_truth(X2))).
% 0.12/0.37 cnf(i_0_44, plain, (a_truth(normal(X1))|a_truth(truthteller(X1))|~a_truth(lower(X2,X1))|~a_truth(liar(X2)))).
% 0.12/0.37 cnf(i_0_40, plain, (a_truth(normal(X1))|a_truth(liar(X1))|a_truth(X2)|~a_truth(says(X1,X2)))).
% 0.12/0.37 cnf(i_0_47, plain, (a_truth(normal(X1))|a_truth(liar(X1))|~a_truth(lower(X1,X2))|~a_truth(truthteller(X2)))).
% 0.12/0.37 cnf(i_0_50, plain, (a_truth(lower(X1,X2))|a_truth(truthteller(X1))|~a_truth(not_lower(X2,X1))|~a_truth(truthteller(X2)))).
% 0.12/0.37 cnf(i_0_51, plain, (a_truth(liar(X1))|~a_truth(not_lower(X2,X1))|~a_truth(liar(X2)))).
% 0.12/0.37 cnf(i_0_52, plain, (a_truth(lower(X1,X2))|a_truth(normal(X1))|~a_truth(not_lower(X2,X1))|~a_truth(normal(X2)))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 11 steps
% 0.12/0.37 cnf(i_0_54, hypothesis, (a_truth(says(b,not_lower(a,b)))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_142, plain, (a_truth(says(b,not_lower(a,b)))), inference(extension_rule, [i_0_38])).
% 0.12/0.37 cnf(i_0_309, plain, (~a_truth(liar(b))), inference(extension_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_310, plain, (~a_truth(not_lower(a,b))), inference(etableau_closure_rule, [i_0_310, ...])).
% 0.12/0.37 cnf(i_0_342, plain, (~a_truth(says(b,liar(b)))), inference(extension_rule, [i_0_40])).
% 0.12/0.37 cnf(i_0_421, plain, (a_truth(liar(b))), inference(closure_rule, [i_0_309])).
% 0.12/0.37 cnf(i_0_343, plain, (~a_truth(truthteller(b))), inference(extension_rule, [i_0_33])).
% 0.12/0.37 cnf(i_0_493, plain, (a_truth(liar(b))), inference(closure_rule, [i_0_309])).
% 0.12/0.37 cnf(i_0_420, plain, (a_truth(normal(b))), inference(etableau_closure_rule, [i_0_420, ...])).
% 0.12/0.37 cnf(i_0_423, plain, (~a_truth(says(b,says(b,liar(b))))), inference(etableau_closure_rule, [i_0_423, ...])).
% 0.12/0.37 cnf(i_0_492, plain, (a_truth(normal(b))), inference(etableau_closure_rule, [i_0_492, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (18144) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------