TSTP Solution File: SYN005-1.010 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN005-1.010 : 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 : n006.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 : Thu Jul 21 06:07:07 EDT 2022
% Result : Unsatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SYN005-1.010 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jul 12 04:37:50 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 11 Number of unprocessed: 11
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 11 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 11 conjectures.
% 0.14/0.39 # There are 11 start rule candidates:
% 0.14/0.39 # Found 10 unit axioms.
% 0.14/0.39 # Closed tableau found in foldup close cycle with 0 folds and 10 closures done.
% 0.14/0.39 # Found closed tableau while making start rule
% 0.14/0.39 # There were 0 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 0 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 0 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_13, negated_conjecture, (p_1(a,a))).
% 0.14/0.39 cnf(i_0_14, negated_conjecture, (p_2(a,a))).
% 0.14/0.39 cnf(i_0_15, negated_conjecture, (p_3(a,a))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (p_4(a,a))).
% 0.14/0.39 cnf(i_0_17, negated_conjecture, (p_5(a,a))).
% 0.14/0.39 cnf(i_0_18, negated_conjecture, (p_6(a,a))).
% 0.14/0.39 cnf(i_0_19, negated_conjecture, (p_7(a,a))).
% 0.14/0.39 cnf(i_0_20, negated_conjecture, (p_8(a,a))).
% 0.14/0.39 cnf(i_0_21, negated_conjecture, (p_9(a,a))).
% 0.14/0.39 cnf(i_0_22, negated_conjecture, (p_10(a,a))).
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (~p_10(X1,X2)|~p_9(X3,X1)|~p_8(X4,X3)|~p_7(X5,X4)|~p_6(X6,X5)|~p_5(X7,X6)|~p_4(X8,X7)|~p_3(X9,X8)|~p_2(X10,X9)|~p_1(X2,X10))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 11 steps
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (~p_10(a,a)|~p_9(a,a)|~p_8(a,a)|~p_7(a,a)|~p_6(a,a)|~p_5(a,a)|~p_4(a,a)|~p_3(a,a)|~p_2(a,a)|~p_1(a,a)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_23, plain, (~p_10(a,a)), inference(closure_rule, [i_0_22])).
% 0.14/0.39 cnf(i_0_24, plain, (~p_9(a,a)), inference(closure_rule, [i_0_21])).
% 0.14/0.39 cnf(i_0_25, plain, (~p_8(a,a)), inference(closure_rule, [i_0_20])).
% 0.14/0.39 cnf(i_0_26, plain, (~p_7(a,a)), inference(closure_rule, [i_0_19])).
% 0.14/0.39 cnf(i_0_27, plain, (~p_6(a,a)), inference(closure_rule, [i_0_18])).
% 0.14/0.39 cnf(i_0_28, plain, (~p_5(a,a)), inference(closure_rule, [i_0_17])).
% 0.14/0.39 cnf(i_0_29, plain, (~p_4(a,a)), inference(closure_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_30, plain, (~p_3(a,a)), inference(closure_rule, [i_0_15])).
% 0.14/0.39 cnf(i_0_31, plain, (~p_2(a,a)), inference(closure_rule, [i_0_14])).
% 0.14/0.39 cnf(i_0_32, plain, (~p_1(a,a)), inference(closure_rule, [i_0_13])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # NOT attempting initial tableau saturation
% 0.14/0.39 # 1 start rule tableaux created.
% 0.14/0.39 # 1 extension rule candidate clauses
% 0.14/0.39 # 10 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Proof search is over...
% 0.14/0.39 # Freeing feature tree
%------------------------------------------------------------------------------