TSTP Solution File: PUZ034-1.004 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ034-1.004 : 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 : n018.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:11:00 EDT 2022
% Result : Unsatisfiable 10.50s 1.73s
% Output : CNFRefutation 10.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ034-1.004 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n018.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 : 600
% 0.12/0.34 % DateTime : Sat May 28 22:42:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 18 Number of unprocessed: 18
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 18 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 1 conjectures.
% 0.19/0.37 # There are 1 start rule candidates:
% 0.19/0.37 # Found 9 unit axioms.
% 0.19/0.37 # 1 start rule tableaux created.
% 0.19/0.37 # 9 extension rule candidate clauses
% 0.19/0.37 # 9 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.37 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 19 tableaux to operate on
% 10.50/1.73 # There were 1 total branch saturation attempts.
% 10.50/1.73 # There were 0 of these attempts blocked.
% 10.50/1.73 # There were 0 deferred branch saturation attempts.
% 10.50/1.73 # There were 0 free duplicated saturations.
% 10.50/1.73 # There were 1 total successful branch saturations.
% 10.50/1.73 # There were 0 successful branch saturations in interreduction.
% 10.50/1.73 # There were 0 successful branch saturations on the branch.
% 10.50/1.73 # There were 1 successful branch saturations after the branch.
% 10.50/1.73 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.50/1.73 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.50/1.73 # Begin clausification derivation
% 10.50/1.73
% 10.50/1.73 # End clausification derivation
% 10.50/1.73 # Begin listing active clauses obtained from FOF to CNF conversion
% 10.50/1.73 cnf(i_0_21, plain, (less(n0,s(X1)))).
% 10.50/1.73 cnf(i_0_23, plain, (sum(X1,n0,X1))).
% 10.50/1.73 cnf(i_0_34, plain, (do_queens(empty_list,X1,X1))).
% 10.50/1.73 cnf(i_0_25, plain, (select(X1,cons(X1,X2),X2))).
% 10.50/1.73 cnf(i_0_20, plain, (range(X1,X1,cons(X1,empty_list)))).
% 10.50/1.73 cnf(i_0_36, negated_conjecture, (~queens(s(s(s(s(n0)))),X1))).
% 10.50/1.73 cnf(i_0_28, plain, (~same(n0,s(X1)))).
% 10.50/1.73 cnf(i_0_27, plain, (~same(s(X1),n0))).
% 10.50/1.73 cnf(i_0_32, plain, (~diagonal_attack(X1,X2,empty_list))).
% 10.50/1.73 cnf(i_0_22, plain, (less(s(X1),s(X2))|~less(X1,X2))).
% 10.50/1.73 cnf(i_0_29, plain, (same(X1,X2)|~same(s(X1),s(X2)))).
% 10.50/1.73 cnf(i_0_30, plain, (diagonal_attack(X1,s(n0),X2)|~attack(X1,X2))).
% 10.50/1.73 cnf(i_0_24, plain, (sum(X1,s(X2),s(X3))|~sum(X1,X2,X3))).
% 10.50/1.73 cnf(i_0_26, plain, (select(X1,cons(X2,X3),cons(X2,X4))|~select(X1,X3,X4))).
% 10.50/1.73 cnf(i_0_19, plain, (range(X1,X2,cons(X1,X3))|~sum(X1,s(n0),X4)|~less(X1,X2)|~range(X4,X2,X3))).
% 10.50/1.73 cnf(i_0_35, plain, (queens(X1,X2)|~do_queens(X3,empty_list,X2)|~sum(X1,s(n0),X4)|~sum(X1,X1,X5)|~range(X4,X5,X3))).
% 10.50/1.73 cnf(i_0_33, plain, (do_queens(X1,X2,X3)|attack(X4,X2)|~do_queens(X5,cons(X4,X2),X3)|~select(X4,X1,X5))).
% 10.50/1.73 cnf(i_0_31, plain, (diagonal_attack(X1,X2,X3)|same(X4,X1)|same(X5,X1)|~diagonal_attack(X1,X6,cons(X7,X3))|~sum(X6,s(n0),X2)|~sum(X4,X6,X7)|~sum(X7,X6,X5))).
% 10.50/1.73 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 10.50/1.73 # Begin printing tableau
% 10.50/1.73 # Found 5 steps
% 10.50/1.73 cnf(i_0_26, plain, (select(X7,cons(X9,cons(X7,X9)),cons(X9,X9))|~select(X7,cons(X7,X9),X9)), inference(start_rule)).
% 10.50/1.73 cnf(i_0_356, plain, (~select(X7,cons(X7,X9),X9)), inference(closure_rule, [i_0_25])).
% 10.50/1.73 cnf(i_0_355, plain, (select(X7,cons(X9,cons(X7,X9)),cons(X9,X9))), inference(extension_rule, [i_0_26])).
% 10.50/1.73 cnf(i_0_986, plain, (select(X7,cons(X6,cons(X9,cons(X7,X9))),cons(X6,cons(X9,X9)))), inference(extension_rule, [i_0_26])).
% 10.50/1.73 cnf(i_0_1212, plain, (select(X7,cons(X8,cons(X6,cons(X9,cons(X7,X9)))),cons(X8,cons(X6,cons(X9,X9))))), inference(etableau_closure_rule, [i_0_1212, ...])).
% 10.50/1.73 # End printing tableau
% 10.50/1.73 # SZS output end
% 10.50/1.73 # Branches closed with saturation will be marked with an "s"
% 10.50/1.73 # Child (13029) has found a proof.
% 10.50/1.73
% 10.50/1.73 # Proof search is over...
% 10.50/1.73 # Freeing feature tree
%------------------------------------------------------------------------------