TSTP Solution File: SYN555-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN555-1 : TPTP v8.1.0. Released v2.5.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 : n014.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:12:26 EDT 2022
% Result : Unsatisfiable 0.21s 0.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN555-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jul 12 08:51:19 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.38 #
% 0.21/0.38 # Presaturation interreduction done
% 0.21/0.38 # Number of axioms: 12 Number of unprocessed: 12
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 12 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 12 conjectures.
% 0.21/0.38 # There are 12 start rule candidates:
% 0.21/0.38 # Found 6 unit axioms.
% 0.21/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.38 # 12 start rule tableaux created.
% 0.21/0.38 # 6 extension rule candidate clauses
% 0.21/0.38 # 6 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_13, negated_conjecture, (p2(X1,X1))).
% 0.21/0.39 cnf(i_0_16, negated_conjecture, (p4(f5(c7,c10,c9),c9))).
% 0.21/0.39 cnf(i_0_14, negated_conjecture, (p4(X1,X1))).
% 0.21/0.39 cnf(i_0_15, negated_conjecture, (p3(X1,X1))).
% 0.21/0.39 cnf(i_0_18, negated_conjecture, (p4(f5(c7,X1,c8),f5(c7,X1,c9)))).
% 0.21/0.39 cnf(i_0_17, negated_conjecture, (~p4(f5(c7,c10,c8),c8))).
% 0.21/0.39 cnf(i_0_19, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.39 cnf(i_0_20, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.39 cnf(i_0_21, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.21/0.39 cnf(i_0_23, negated_conjecture, (p4(f5(X1,X2,X3),f5(X4,X5,X6))|~p3(X2,X5)|~p4(X3,X6)|~p2(X1,X4))).
% 0.21/0.39 cnf(i_0_22, negated_conjecture, (p3(f6(X1,X2,X3),f6(X4,X5,X6))|~p3(X1,X4)|~p4(X3,X6)|~p4(X2,X5))).
% 0.21/0.39 cnf(i_0_24, negated_conjecture, (p4(f5(c7,X1,X2),X2)|~p4(f5(c7,f6(X1,X3,X2),X3),f5(c7,f6(X1,X3,X2),X2))|~p4(f5(c7,X1,X3),X3))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 9 steps
% 0.21/0.39 cnf(i_0_24, negated_conjecture, (p4(f5(c7,c10,c8),c8)|~p4(f5(c7,f6(c10,c8,c8),c8),f5(c7,f6(c10,c8,c8),c8))|~p4(f5(c7,c10,c8),c8)), inference(start_rule)).
% 0.21/0.39 cnf(i_0_25, plain, (p4(f5(c7,c10,c8),c8)), inference(closure_rule, [i_0_17])).
% 0.21/0.39 cnf(i_0_26, plain, (~p4(f5(c7,f6(c10,c8,c8),c8),f5(c7,f6(c10,c8,c8),c8))), inference(closure_rule, [i_0_14])).
% 0.21/0.39 cnf(i_0_27, plain, (~p4(f5(c7,c10,c8),c8)), inference(extension_rule, [i_0_24])).
% 0.21/0.39 cnf(i_0_53, plain, (~p4(f5(c7,c10,c9),c9)), inference(closure_rule, [i_0_16])).
% 0.21/0.39 cnf(i_0_52, plain, (~p4(f5(c7,f6(c10,c9,c8),c9),f5(c7,f6(c10,c9,c8),c8))), inference(extension_rule, [i_0_23])).
% 0.21/0.39 cnf(i_0_59, plain, (~p3(f6(c10,c9,c8),f6(c10,c9,c8))), inference(closure_rule, [i_0_15])).
% 0.21/0.39 cnf(i_0_61, plain, (~p2(c7,c7)), inference(closure_rule, [i_0_13])).
% 0.21/0.39 cnf(i_0_60, plain, (~p4(c9,c8)), inference(etableau_closure_rule, [i_0_60, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_13, negated_conjecture, (p2(X1,X1))).
% 0.21/0.39 cnf(i_0_16, negated_conjecture, (p4(f5(c7,c10,c9),c9))).
% 0.21/0.39 cnf(i_0_14, negated_conjecture, (p4(X1,X1))).
% 0.21/0.39 cnf(i_0_15, negated_conjecture, (p3(X1,X1))).
% 0.21/0.39 cnf(i_0_18, negated_conjecture, (p4(f5(c7,X1,c8),f5(c7,X1,c9)))).
% 0.21/0.39 cnf(i_0_17, negated_conjecture, (~p4(f5(c7,c10,c8),c8))).
% 0.21/0.39 cnf(i_0_19, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.39 cnf(i_0_20, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.39 cnf(i_0_21, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.21/0.39 cnf(i_0_23, negated_conjecture, (p4(f5(X1,X2,X3),f5(X4,X5,X6))|~p3(X2,X5)|~p4(X3,X6)|~p2(X1,X4))).
% 0.21/0.39 cnf(i_0_22, negated_conjecture, (p3(f6(X1,X2,X3),f6(X4,X5,X6))|~p3(X1,X4)|~p4(X3,X6)|~p4(X2,X5))).
% 0.21/0.39 cnf(i_0_24, negated_conjecture, (p4(f5(c7,X1,X2),X2)|~p4(f5(c7,f6(X1,X3,X2),X3),f5(c7,f6(X1,X3,X2),X2))|~p4(f5(c7,X1,X3),X3))).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 8 steps
% 0.21/0.39 cnf(i_0_20, negated_conjecture, (p4(f5(c7,c10,c8),c8)|~p4(c8,c8)|~p4(c8,f5(c7,c10,c8))), inference(start_rule)).
% 0.21/0.39 cnf(i_0_39, plain, (p4(f5(c7,c10,c8),c8)), inference(closure_rule, [i_0_17])).
% 0.21/0.39 cnf(i_0_40, plain, (~p4(c8,c8)), inference(closure_rule, [i_0_14])).
% 0.21/0.39 cnf(i_0_41, plain, (~p4(c8,f5(c7,c10,c8))), inference(extension_rule, [i_0_20])).
% 0.21/0.39 cnf(i_0_66, plain, (~p4(f5(c7,c10,c8),f5(c7,c10,c8))), inference(closure_rule, [i_0_14])).
% 0.21/0.39 cnf(i_0_67, plain, (~p4(f5(c7,c10,c8),c8)), inference(extension_rule, [i_0_24])).
% 0.21/0.39 cnf(i_0_70, plain, (~p4(f5(c7,c10,c9),c9)), inference(closure_rule, [i_0_16])).
% 0.21/0.39 cnf(i_0_69, plain, (~p4(f5(c7,f6(c10,c9,c8),c9),f5(c7,f6(c10,c9,c8),c8))), inference(etableau_closure_rule, [i_0_69, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # Child (11750) has found a proof.
% 0.21/0.39
% 0.21/0.39 # Proof search is over...
% 0.21/0.39 # Freeing feature tree
%------------------------------------------------------------------------------